Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz0618
%A S. M. A. Eslami
%A et al ...
%A D. Hassabis
%T Neural scene representation and rendering
%J Science
%V 360
%N 6394
%P 1204-1210
%M JUN
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0618, DeepMind, google, NN, ANN,
artificial, computer vision, GQN, Generative Query, scene representation,
sensory, 3D, AI
%X "Scene representation - the process of converting visual sensory data into
concise descriptions ... we introduce the Generative Query Network (GQN), a
framework within which machines learn to represent scenes using only their
own sensors. The GQN takes as input images of a scene taken from different
viewpoints, constructs an internal representation, and uses this
representation to predict the appearance of that scene from previously
unobserved viewpoints. The GQN demonstrates representation learning without
human labels or domain knowledge, paving the way toward machines that
autonomously learn to understand the world around them."
-- [doi:10.1126/science.aar6170]['18].
(?run for the hills?)
%A D. J. Rose
%A R. E. Tarjan
%A G. S. Lueker
%T Algorithmic aspects of vertex elimination on graphs
%J SIAM J. Comput.
%V 5
%N 2
%P 266-283
%D 1976
%K jrnl, c1976, c197x, c19xx, zz0618, maths, graph, graphs, vertex elimination,
fill-in, fillin, Gaussian elimination, sparse symmetric, linear, ordering,
chordal, minimal triangulation, algorithm, undirected, directed
%X "We consider a graph-theoretic elimination process which is related to
performing Gaussian elimination on sparse symmetric +ve definite systems of
linear equns. We give a new linear-time alg. to calculate the fill-in
produced by any elimination ordering, & we give two new related algs. for
finding orderings with special properties. One alg., based on breadth-first
search, finds a perfect elimination ordering, if any exists, in O(n+e) time,
if the problem g. has n vertices & e edges. An extension of this alg. finds a
minimal (but not necessarily minimum) ordering in O(ne) time. We conjecture
that the problem of finding a minimum ordering is NP-complete."
-- [doi:10.1137/0205021]['18],
Finds a use in 'optimal decomp by ...', H.-G. Leimer, 1993.
[Also search for: minimal triangulation] and [also search for: Rose c1972].
(BTW also, R.&T., 'Alg ... on *directed* graphs', SIAM J Appl Maths, 34(1),
1978, [Jstor]['18], and
TR@[stanf.]['18].)
%A H.-G. Leimer
%T Optimal decomposition by clique separators
%J Discrete Maths.
%V 113
%N 1-3
%M APR
%D 1993
%K jrnl, c1993, c199x, c19xx, zz0618, maths, graph, decomposition, clique,
separator, algorithm, maximal prime subgraph, subgraphs
%X "... [Tarjan's 1985 O(mn)-time] alg. is modified, so that
no new maximal prime subgraphs are generated, i.e. so that a graph is
decomposed exactly into its maximal prime subgs. which is the
unique minimal derived system of prime subgraphs."
-- [doi:10.1016/0012-365X(93)90510-Z]['18].
(L's alg. esp. depends on Rose, Tarjan & Lueker 1976, and on Tarjan 1985.)
[Also search for: graph decomposition] and [also search for: Tarjan c1985].
%A K. Kurita
%A K. Wasa
%A A. Conte
%A H. Arimura
%A T. Uno
%T Efficient enumeration of subgraphs and induced subgraphs with bounded girth
%J arXiv
%M JUN
%D 2018
%K TR, c2018, c201x, c20xx, zz0618, enumerate, enumeration, subgraph, graph,
algorithm, girth
%X "The girth of a graph is the length of its shortest cycle. Due to its
relevance in graph theory, n/wk analysis ... we consider the problem of
listing connected subgraphs with bounded girth. As a large girth is index of
sparsity, this allows to extract sparse structures from the input g.. We
propose two algs., for enumerating respectively vertex induced subgs. & edge
induced subgs. with bounded girth, both running in O(n) amortized time per
soln & using O(n^3) space. [&] the algs. can be easily adapted to relax the
connectivity requirement & to deal with weighted graphs. As a byproduct, the
2nd alg. can be used to answer the well known question of finding the
densest n-vertex graph(s) of girth k."
-- 1806.04307@[arXiv]['18].
[Also search for: enumerate subgraph].
%A L. Allison
%T Coding Ockham's Razor
%I Springer
%D 2018
%K book, text, c2018, c201x, c20xx, zz0618, LAllison, Occam, Ockham razor, MDL,
minimum message length, description, MML, AIC, BIC, statistics, probability,
model, distribution, estimate, estimation, likelihood, inductive inference,
Bayesian, artificial intelligence, AI, kdd, decision, tree, Dtree, nml, mmld,
clustering, snob, L4ref, mixture model, Gaussian, multistate, multinomial,
vonMises, Fisher, vMF, Poisson, geometric, modelling, machine learning,
discovery, algorithm, iris data, regression, stats, L5ref, II, AI, 27 club,
27club, musician, graph, motif, pattern, graphs, graphModel, information,
compression, compress, model, code, entropy, stats
%X "... inductive inference using the minimum message length (MML) principle and
a computer. It is accompanied by a library of software to help an
applications programmer, student or researcher in the fields of data analysis
or machine learning to write computer programs of this kind. ..."
-- [doi:10.1007/978-3-319-76433-7].
uk us isbn:3319764322; uk us isbn13:978-3319764320.
1 Introduction, 2 Discrete, 3 Integers, 4 Continuous, 5 Function-Models,
6 Multivariate, 7 Mixture Models, 8 Function Model 2, 9 Vectors,
10 Linear Regression, 11 Graphs, 12 Bits and Pieces, 13 An Implementation.
(Also see the [mmlist] inc. doc and source code.)
%A J. Soding
%T Protein homology detection by HMM-HMM comparison
%J Bioinformatics
%V 21
%N 7
%P 951-960
%M APR
%D 2005
%K jrnl, MolBio, c2005, c200x, c20xx, zz0618, protein, sequence, similarity,
alignment, HHSearch, HMM, profile, PSIBLAST, HMMER, PROF_SIM, COMPASS
%X "... generalized the alignment of protein seqs. with a profile hidden
Markov model (HMM) to the case of pairwise alignment of profile HMMs. We
present a method for detecting distant homologous relationships between
proteins based on this approach. The method (HHsearch) is benchmarked
together with BLAST, PSI-BLAST, HMMER and the profile-profile comparison
tools PROF_SIM and COMPASS, in an all-against-all comparison of a DB of 3691
p.domains from SCOP 1.63 with pairwise sequence identities below 20%. ..."
-- [doi:10.1093/bioinformatics/bti125]['18].
%A Z. Zhang
%A C. Xing
%A L. Wang
%A B. Gong
%A H. Liu
%T IndelFR: A database of indels in protein structures and their
flanking regions
%J NAR
%V 40
%N D1
%P D512-D518
%M JAN
%D 2012
%K NAR, MolBio, c2012, c201x, c20xx, zz0618, protein, gap, gaps, indel, indels
%X "Recent studies showed that indels could affect their flanking regions and
they are important for protein function and evolution. ... The IndelFR DB
contains 2,925,017 indels with flanking regions extracted from 373,402
structural alignment pairs of 12,573 non-redundant domains from 1053
superfamilies. ..."
-- [doi:10.1093/nar/gkr1107]['18].
[Also search for: MolBio protein indels].
%A S. Nmepomnyachiy
%A N. Ben-Tal
%A R. Kolodny
%T Complex evolutionary footprints revealed in an analysis of reused protein
segments of diverse lengths
%J PNAS
%V 114
%N 44
%P ?
%M OCT
%D 2017
%K jrnl, PNAS, MolBio, c2017, c201x, c20xx, zz0618, BenTal, theme, themes,
protein, structure, pattern, evolution, recurring, reuse, segment, fragment,
library, ECOD, HHSearch
%X "... To systematically explore the evolutionary traces of segment 'reuse'
across proteins, we developed an automated methodology that identifies reused
segments from protein alignments. We search for 'themes' - segs. of >=35
residues of similar seq. & structure - reused within representative sets of
15,016 domains [Evolutionary Classification of Protein Domains (ECOD)
database] or 20,398 chains [Protein Data Bank (PDB)]. We observe that theme
reuse is highly prevalent & that reuse is more extensive when the length
threshold for identifying a theme is lower. Structural domains, the best
characterized form of reuse in proteins, are just one of many complex &
intertwined evolutionary traces. Others include long themes shared among a
few proteins, which encompass & overlap with shorter themes that recur in
numerous proteins. ..."
-- [doi:10.1073/pnas.1707642114]['18].
& supp@[www]['18].
["... 'themes' - segs. of >=35 residues of similar seq. & structure ...
present an automated pipeline to identify segs. of various lengths [35-200]
of reused seqs. [themes] that also have similar structs. ...
align all-vs.-all ... calc. for each sig. alignment the % of similarity of
aligned residues and the rmsd of the C_a atoms of the aligned residues. ...
similarity n/wks [where sim > 40% & rmsd < 3.5A] ... connected cmpts ..."]
[Also search for: MolBio protein structure pattern].
%A I. K. Suzuki
%A et al ...
%A P. Vanderhaeghen
%T Human-specific NOTCH2NL genes expand cortical neurogenesis through
Delta/Notch regulation
%J Cell
%V 173
%N 6
%P 1370-1384
%M MAY
%D 2018
%K jrnl, MolBio, c2018, c201x, c20xx, zz0618, animal, human, brain, size,
gene, genes, NOTCH2NLA, NOTCH2NL, NOTCH2, NOTCH, chr1, chromosome1, Delta,
neocortex, cortex, development, evolution, RNA seq, RNAseq
%X "The cerebral cortex underwent rapid expansion & increased complexity during
recent hominid evolution. Gene duplications constitute a major evolutionary
force, but their impact on human brain development remains unclear. Using
tailored RNA sequencing (RNA-seq), we profiled the spatial & temporal
expression of hominid-specific duplicated (HS) genes in the human fetal
cortex & identified a repertoire of 35 HS genes displaying robust & dynamic
patterns during cortical neurogenesis. Among them NOTCH2NL, human-specific
paralogs of the NOTCH2 receptor, stood out for their ability to promote
cortical progenitor maintenance. NOTCH2NL promote the clonal expansion of
human cortical progenitors, ultimately leading to higher neuronal output. At
the molecular level, NOTCH2NL function by activating the Notch pathway
through inhibition of cis Delta/Notch interactions. Our study uncovers a
large repertoire of recently evolved genes active during human corticogenesis
& reveals how human-specific NOTCH paralogs may have contributed to the
expansion of the human cortex."
-- [doi:10.1016/j.cell.2018.03.067]['18].
[Also search for: human NOTCH2NL].
%A I. T. Fiddes
%A et al ...
%A D. Haussler
%T Human-specific NOTCH2NL genes affect Notch signaling and cortical
neurogenesis
%J Cell
%V 173
%N 6
%P 1356-1369
%M MAY
%D 2018
%K jrnl, MolBio, c2018, c201x, c20xx, zz0618, animal, human, brain, size,
gene, genes, NOTCH2NLA, NOTCH2NL,NOTCH2, NOTCH, chr1, chromosome1, 1q21.1,
macrocephaly, autism, schizophrenia, neocortex
%X "... find that three paralogs of human-specific NOTCH2NL are highly expressed
in radial glia. Functional analysis reveals that different alleles of
NOTCH2NL have varying potencies to enhance Notch signaling by interacting
directly with NOTCH receptors. Consistent with a role in Notch signaling,
NOTCH2NL ectopic expression delays differentiation of neuronal progenitors,
while deletion accelerates differentiation into cortical neurons. [&]
NOTCH2NL genes provide the breakpoints in 1q21.1 distal deletion/duplication
syndrome, where duplications are associated with macrocephaly & autism &
deletions with microcephaly & schizophrenia. Thus, the emergence of
human-specific NOTCH2NL genes may have contributed to the rapid evolution of
the larger human neocortex, accompanied by loss of genomic stability at the
1q21.1 locus & resulting recurrent neurodevelopmental disorders."
-- [doi:10.1016/j.cell.2018.03.051]['18].
[Also search for: human NOTCH2NL].
%T Uniform Requirements for Manuscripts Submitted to Biomedical Journals:
Writing and Editing for Biomedical Publication
%Q ICMJE
%J BMJ
%D 1978
%K c1978, c1979, c197x, c19xx, zz0618, Vancouver protocol, scientific, academic,
scholarly, research, papers, publications, manuscipts, journals, NLM, ICMJE,
journal editors, publish, perish
%X E.g., 'For Debate ...', BMJ, 1, 1334, 20/5/1978 [doi:10.1136/bmj.1.6123.1334]['18].
And later editions, e.g., at [www]['18].
Also see [icmje.org]['18].
[Also search for: publish perish].
%A M. Lesk
%T How many scientific papers are not original?
%J PNAS
%V 112
%N 1
%P 6-7
%M JAN
%D 2015
%K jrnl, PNAS, c2015, c201x, c20xx, zz0618, MLesk, publish, perish, science,
research, paper, papers, publications, plagiarism, fraud, original,
refereeing
%X "Is plagiarism afflicting science ... In 1830, Charles Babbage deplored
unreliable science. He discussed hoaxes, forgeries, data trimming, and
'cooking' (selecting data to match a theory) ..."
-- [doi:10.1073/pnas.1422282112]['18].
%T China sets a strong example on how to address scientific fraud
%A Editor
%J Nature
%V 558
%N 7709
%P 162
%M JUN
%D 2018
%K news, views, c2018, c201x, c20xx, zz0618, academic, scientific, research,
misconduct, fraud, Chinese, law
%X "... One of the most striking conditions is that researchers will be deterred
from publishing findings in journals that China deems to be of poor academic
quality, poorly managed and set up merely for profit. ... China is handing
the responsibility for deterring and investigating scientific misconduct to
the government's science ministry. ..."
-- [doi:10.1038/d41586-018-05417-1]['18].
And also,
"China introduces sweeping reforms to crack down on academic misconduct ..."
by David Cyranoski
-- [doi:10.1038/d41586-018-05359-8]['18].
%A J. Tregoning
%T How will you judge me if not by impact factor?
%J Nature
%V 558
%N 7710
%P ?-?
%M JUN
%D 2018
%K views, c2018, c201x, c20xx, zz0618, publish, perish, impact, KPI, KPIs, JIF,
publications, journal, scientific research, university, DORA, Hindex
%X "Rumours among junior faculty members are that reports of the death of the
impact factor are greatly exaggerated. ... Ideally, just putting our research
out there should be enough for people to descry our brilliance & promote
it accordingly. But that is not how the system works. ... Although DORA is
in my heart, impact factors are still on my mind. ..."
-- [doi:10.1038/d41586-018-05467-5]['18].
[Also search for: publish perish] and [also search for: Hindex abuse].
%A W. K. T. Cho
%T Algorithms can foster a more democratic society
%J Nature
%V 558
%N 7711
%P ?-?
%M JUN
%D 2018
%K news, views, c2018, c201x, c20xx, zz0618, USA, election, elections,
politics, gerrymander, America, political, boundaries
%X "Gerrymandering - the manipulation of district boundaries to give one group
a political advantage ... the contorted shapes of electoral districts defy
simple explanation and imbue a public perception of a rigged system. And when
as in Pennsylvania in 2014, a party captures 72% of its US House of
Representatives seats with only 55.5% of the statewide vote, suspicions are
piqued. ... In the United States, electoral districts are redrawn every
ten years. ..."
-- [doi:10.1038/d41586-018-05498-y]['18].
[Also search for: gerrymander].
%A R. E. Tarjan
%T Decomposition by clique separators
%J Discrete Math.
%V 55
%N 2
%P 221-232
%M JUL
%D 1985
%K jrnl, c1985, c198x, c19xx, zz0618, maths, graph, graphs, separator, clique,
complete, colouring, coloring, simplicial, binary, tree, decomposition,
algorithm, fill-in, Gaussian elimination, maximum clique, colouring,
coloring, independent set
%X "... finding cliques (complete graphs) whose removal disconnects the graph.
We give an O(nm)-time algorithm for finding a decomposition of an n-vertex,
m-edge graph. We describe how such a decomposition can be used in
divide-and-conquer algorithms for various graph problems, such as
graph coloring and finding maximum independent sets. We survey classes of
graphs for which such divide-and-conquer algs. are especially useful."
"... The binary decomposition tree of a graph is far from unique ..."
-- [doi:10.1016/0012-365X(85)90051-2]['18].
Finds a use in 'optimal decomp by ...', H.-G. Leimer, 1993,
Discr. Maths., 113, 99-123.
[Also search for: decomposition defn] and [also search for: Leimer c1993].
%A R. Diestel
%T Simplicial decomposition of graphs - some uniqueness results
%J J. Comb. Theory
%V 42
%S B
%P 133-145
%M APR
%D 1987
%K jrnl, JCT, c1983, c198x, c19xx, zz0618, maths, graph, simplicial,
decomposition, decompose, prime, primes, simplices, cliques, attachment
%X "A simplicial decomposition of a graph G is the recursively defined analog to
writing G as the union of two proper subgraphs overlapping in a complete
graph (a 'simplex' [clique]). We consider simplicial decompositions into
primes, i.e., into graphs that cannot be decomposed further in this way. Such
decompositions can be used for characterizing suitable graph properties by
giving a list of B of possible primes of their members g eps G, together with
an explicit rule stating how exactly one must assemble the elements of B to
obtain the members of G. For such characterizations results are needed
asserting the independence of the factors as well as of the 'simplices of
attachment' from the decomposition chosen. We prove such uniqueness results
by characterizing both prime factors and simplices of attachment without
reference to any particular decomposition. ..."
-- [doi:10.1016/0095-8956(87)90035-9]['18].
[Also search for: simplicial]
%A T. S. Verma
%A J. Pearl
%T An algorithm for deciding if a set of observed independencies has a causal
explanation
%J UAI
%D 1992
%K conf, UAI, UAI92, UAI1992, c1992, c199x, c19xx, zz0618, maths, graph, DAG,
recovery, reconstruction, DAGs, partially directed, partiallyDAG, PDAG,
causal model, models, d-separation, dSeparation, collider, DAGisomorphic
%X "... address the question of deciding whether there exists a causal model
that explains ALL the observed dependencies & independencies. Formally, given
a list M of conditional independence statements, it is required to decide
whether there exists a directed acyclic graph (DAG) D that is perfectly
consistent with M, namely, every statement in M, & no other, is reflected via
d-separation in D. We present & analyze an effective alg. that tests for the
existence of such a day, and produces one, if it exists."
-- 1303.543@[arXiv]['18],
[c'tes'er]['18].
[Also search for: PDAG] and [also search for: graph recovery algorithm].
%A R. Diestel
%T Simplicial decompositions, tree-decompositions and graph minors
%J Ars Combinatoria
%V 25C
%P 97-104
%D 1988
%K jrnl, c1988, c198x, c19xx, zz0618, maths, graph, graphs, tree, simplicial,
decomposition, decompose, minor, primes, Robertson, Seymour, Halin,
uniqueness, simplices, attachment
%X "... gives a summary of open problems and recent results concerning the
existence and uniqueness of simplicial decompositions (Halin) &
tree-decompositions (Robertson/Seymour) into primes." (15 refs.)
And,
"... it is not difficult to show that every finite graph admits a
simplicial decomp. into primes (see Halin[11]). Moreover, Halin[9] was
able to extend this result to graphs of any cardinality which do not contain
an infinite simplex. ... When Halin posed the above problem in [9], he also
showed that gs. not admitting a simp.decomposition into primes exist ..."
-- [UniH]['18],
at [publns]['18].
(Simplicial tree-decomposition v. simplicial-d. v. tree-d.)
[Also search for: Diestel graph] and [also search for: graph decomposition].
%A M. Studeny
%T On separation criterion and recovery algorithm for chain graphs
%J UAI
%D 1996
%O Int. J. Approx. Reasoning, 17(2-3), pp.265-293, Aug-Oct, 1997,
doi:10.1016/S0888-613X(97)00018-2
%K conf, UAI96, UAI1996, c1996, c199x, c19xx, zz0618, maths, chain graph,
chainGraph, hybrid, DAG, DAGs, recovery, reconstruction, causal model,
dependency, criteria
%X "Chain graphs (CGs) give a natural unifying point of view on Markov and
Bayesian networks & enlarge the potential of graphical models for
description of conditional in dependence structures. ... a didrect graphical
separation criterion for CGs which generalizes the d-separation criterion
for B.n/wks is introduced (recalled). It is equiv. to the classic
moralization criterion for CGs & complete m the sense that for every CG there
exists a prob.distn satisfying exactly independencies derivable from the CG
by the separation criterion. Every class of Markov equivalent CGs can be
uniquely described by a natural representative, called the largest CG. A
recovery alg., which on basis of the (cond.) dependency model given by a CG
finds the corresponding largest CG, is p.
-- 1302.3606@[arXiv]['18],
IJAR@[doi:10.1016/S0888-613X(97)00018-2]['18].
[Also search for: chainGraph] & [also search for: graph recovery algorithm].
%A J.-M. A Allen
%A J. Barrett
%A D. C. Horsman
%A C. M. Lee
%A R. W. Spekkens
%T Quantum common causes and quantum causal models
%J Physical Rev. X
%V 7
%N 3
%M JUL
%D 2017
%K jrnl, physics, c2017, c201x, c20xx, zz0618, quantum, common cause, causality,
Reichenbach's principle, Reichenbachs, model
%X "Reichenbach's principle asserts that if two observed variables are found to
be correlated, then there should be a causal explanation of these
correlations. [&] if the explanation is in terms of a common cause, then the
cond. prob. distn over the vars. given the complete common cause
should factorize. The principle is generalized by the formalism of causal
models, in which the causal relationships among vars. constrain the form
of their joint prob. distn. In the quantum case, however, the observed
correlations in Bell experiments cannot be explained in the manner R.'s
principle would seem to demand. Motivated by this, we introduce a quantum
counterpart to the principle. We demonstrate that under the assumption that
quantum dynamics is fundamentally unitary ..."
-- [doi:10.1103/PhysRevX.7.031021]['18].
(Also see auth3@[sch'l'r]['18].)
%A S. Aaronson
%T PDQP/qpoly = ALL
%D 2018
%K TR, c2018, c201x, c20xx, zz0618, quantum computing, computer, information.
quomplexity, qomplexity, advice, UTexasA, UTexas, PDQP, qpoly,
non-collapsing measurements, Raz
%X "We show that combining two different hypothetical enhancements to quantum
computation - namely, quantum advice and non-collapsing measurements - would
let a quantum computer solve any decision problem whatsoever in polynomial
time, even though neither enhancement yields extravagant power by itself.
This complements a related result due to Raz. The proof uses locally
decodable codes."
-- 1805.08577@[arXiv]['18],
pdf@[www]['18].
Says, "to appear in Quantum Information and Computation, 2018".
%A S. Hossenfelder
%T Lost in Math: How Beauty Leads Physics Astray
%I BasicBooks
%P 304
%M JUN
%D 2018
%K book, text, physics, c2018, c201x, c20xx, zz0618, maths, theory, theories,
Sabine Hossenfelder
%X 1st ed 2018; hb us$23; uk us isbn:0465094252; uk us isbn13:978-0465094257.
"... physicists believe the best theories are beautiful, natural, and
elegant, and this standard separates popular theories from disposable ones.
This is why, Sabine Hossenfelder argues, we have not seen a major
breakthrough in the foundations of physics for more than four decades. The
belief in beauty has become so dogmatic that it now conflicts with scientific
objectivity: observation has been unable to confirm mindboggling theories,
like supersymmetry or grand unification, invented by physicists based on
aesthetic criteria. ..."
[Also search for: Sabine Hossenfelder].
%A R. K. Guy
%T The strong law of small numbers
%J Amer. Math. Monthly
%V 95
%P 697-712
%D 1988
%K c1988, c198x, c19xx, zz0618, maths, stats, strong, law, small, number,
examples, series, sequence, pattern, patterns, number theory
%X 'This paper contains 35 examples of patterns, taken largely from number
theory and discrete mathematics, that seem to appear when one looks at
several small examples but do not hold up under additional scrutiny,
supporting the author's proposed law: "There aren't enough small numbers to
meet the many demands to them."'
-- pdf@[www]['18].
[Also search for: Guy strong law].
%A R. K. Guy
%T The second strong law of small numbers
%J Mathematics Mag.
%V 63
%N 1
%P 3-20
%M FEB
%D 1990
%K jrnl, c1990, c199x, c19xx, zz0618, maths, number theory, examples,
strong law, series
%X "... The Second Strong Law of Small Numbers:
When two numbers look equal, it ain't necessarily so! ..."
-- [doi:10.2307/2691503]['18],
or [Jstor]['18].
[Also search for: Guy strong law].
%A X.-L. Meng
%A D. van Dyk
%T The EM algorithm - an old folk-song sung to a fast new tune
%J JRSS (B)
%V 59
%N 3
%P 511-567
%D 1997
%K jrnl, JRSS, c1997, c199x, c19xx, zz0618, vanDyk, EM algorithm, EMalgorithm,
stats, history, Dempster, Laird, Rubin
%X "Celebrating the 20th anniversary of the presentation of the paper by
Dempster, Laird & Rubin which popularized the EM alg., ... after a brief
historical a/c, strategies that aim to make the EM alg. converge faster while
maintaining its simplicity & stability ... show, through both empirical &
theoretical evidence, the potential for a dramatic redn in computational
time with little increase in human effort. We also discuss the intrinsic
connection between EM-type algs. & the Gibbs sampler ..."
-- [doi:10.1111/1467-9868.00082]['18],
or 2346009@[Jstor]['18].
[Also search for: EM algorithm].
%A M. Studeny
%A J. Vormeil
%T A reconstruction algorithm for the essential graph
%J Int. J. Approx. Reasoning
%V 50
%N 2
%P 385-413
%M FEB
%D 2009
%K conf, c2009, c200x, c20xx, zz0618, maths, essential graph, essentialGraph,
chainGraph, standard imset, recovery algorithm, reconstruction
%X "A std graphical representative of a Bayesian n/wk structure is a special
chain graph, known as an essential graph. An alt. algebraic approach to the
math. descrn of this statistical model uses instead a certain integer-valued
vector, known as a standard imset. We give a direct formula for the
translation of any chain graph describing a Bayesian n/wk structure into the
standard imset. Moreover, we present a two-stage alg. which makes it possible
to reconstruct the essential graph on the basis of the std imset. The core of
this paper is the proof of the correctness of the algorithm."
-- [doi:10.1016/j.ijar.2008.09.001]['18].
[Also search for: chainGraph].
%A J. M. Noble
%T An algorithm for learning the essential graph
%J arXiv
%M JUL
%D 2010
%K TR, c2010, c201x, c20xx, zz0618, maths, stats, essential graph, DAG,
essentialGraph, chainGraph, MMPC, parents children, MMHC, immoralities
%X "... learning the essential graph of a Bayesian n/wk. The basis ... is the
Maximum Minimum Parents and Children alg. developed by previous authors, with
three substantial modifications. The MMPC alg. is the first stage of the
Maximum Minimum Hill Climbing alg. for learning the DAG of a Bayesian n/wk...
two phases; firstly, the MMPC alg. to locate the skeleton & secondly an edge
orientation phase. The computationally expensive part is the edge orientation
phase. The first modification introduced to the MMPC alg., which requires
little additional computational cost, is to obtain the immoralities & hence
the essential graph. This renders the edge orientation phase, the ...
expensive part, unnecessary, since the entire Markov structure that can be
derived from data is present in the essential graph. Secondly, the MMPC alg.
can accept independence statements that are logically inconsistent with those
rejected, since with tests for independence, a 'do not reject' conclusion for
a particular independence statement is taken as 'accept' independence. An
example is given to illustrate this & a modification is suggested to ensure
that the conditional independence statements are logically consistent.
Thirdly, the MMHC alg. makes an assumption of faithfulness. An example of a
data set is given that does not satisfy this assumption & a modification is
suggested to deal with some situations where the assumption is not satisfied.
The example in question also illustrates problems with the 'faithfulness'
assumption that cannot be tackled by this modification."
-- 1007.2656@[arXiv]['18].
[Also search for: essentialGraph].
%A A. Farruggia
%A T. Gagie
%A G. Navarro
%A S. J. Puglisi
%A J. Siren
%T Relative suffix trees
%J COMPJ
%V 61
%N 5
%P 773-788
%M MAY
%D 2018
%K jrnl, COMPJ, c2018, c201x, c20xx, zz0618, compressed data structure,
suffix tree, index, strings, sequences, genomes
%X "... take a new approach to compressed suffix trees for repetitive sequence
collections, such as collections of individual genomes. We compress the
suffix trees of individual seqs. relative to the suffix tree of a ref.seq..
These relative data structures provide competitive time/space trade-offs,
being almost as small as the smallest compressed suffix trees for repetitive
collections, and competitive in time with the largest and fastest compressed
suffix trees."
-- [doi:10.1093/comjnl/bxx108]['18].
%A M. Roberts
%T Censored: Distraction and Diversion Inside China's Great Firewall
%I PrincetonUP
%D 2018
%K book, text, c2018, c201x, c20xx, zz0618, China, Chinese, PRC, Great Firewall,
censor, censorship, internet, web, www, fake news, influence, propaganda,
manipulation, communist party, CCP, authoritarian, politics, political,
right wing, social credit, control
%X 1st ed 2018; hb us$30; uk us isbn:0691178860; uk us isbn13:978-0691178868.
"As authoritarian governments around the world develop sophisticated
technologies for controlling information ... Roberts demonstrates that even
censorship that is easy to circumvent can still be enormously effective.
Taking advantage of digital data harvested from the Chinese Internet and
leaks from China's Propaganda Department, this important book sheds light on
how and when censorship influences the Chinese public. ... subtler censorship
such as burying search results or introducing distracting information on the
web, is more effective because users are less aware of it. ..."
[Also search for: great firewall].
(Also see [1984].)