Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael Lavine

dblp:39/2442 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 81% Computational social science and digital humanities · 19%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
mixture model
0.212013
Copy or Coincidence? A Model for Detecting Social Influence and Duplication Events · ICML (3) 2013
Data mining
anomaly detection
0.212013
Copy or Coincidence? A Model for Detecting Social Influence and Duplication Events · ICML (3) 2013
Bioinformatics and computational biology › population genetics
genealogical inference
0.112007
The evolutionary forest algorithm · Bioinform. 2007
Bioinformatics and computational biology
phylogenetics
0.112007
The evolutionary forest algorithm · Bioinform. 2007
Bioinformatics and computational biology
population genetics
0.112007
The evolutionary forest algorithm · Bioinform. 2007
Computational social science and digital humanities
social network analysis
0.012013
Copy or Coincidence? A Model for Detecting Social Influence and Duplication Events · ICML (3) 2013

Methods — techniques the papers use, named apart from their topics

mixture model · 0.5likelihood ratio · 0.5monte carlo · 0.1evolutionary forest algorithm · 0.1
YearPublicationVenuePosition
2013 Copy or Coincidence? A Model for Detecting Social Influence and Duplication Events
abstract
In this paper, we analyze the task of inferring rare links between pairs of entities that seem too similar to have occurred by chance. Variations of this task appear in such diverse areas as social network analysis, security, fraud detection, and entity resolution. To address the task in a general form, we propose a simple, flexible mixture model in which most entities are generated independently from a distribution but a small number of pairs are constrained to be similar. We predict the true pairs using a likelihood ratio that trades off the entities’ similarity with their rarity. This method always outperforms using only similarity; however, with certain parameter settings, similarity turns out to be surprisingly competitive. Using real data, we apply the model to detect twins given their birth weights and to re-identify cell phone users based on distinctive usage patterns.
Lisa Friedland, David D. Jensen, Michael Lavine
ICML (3)3
2007 The evolutionary forest algorithm
abstract
MOTIVATION: Gene genealogies offer a powerful context for inferences about the evolutionary process based on presently segregating DNA variation. In many cases, it is the distribution of population parameters, marginalized over the effectively infinite-dimensional tree space, that is of interest. Our evolutionary forest (EF) algorithm uses Monte Carlo methods to generate posterior distributions of population parameters. A novel feature is the updating of parameter values based on a probability measure defined on an ensemble of histories (a forest of genealogies), rather than a single tree. RESULTS: The EF algorithm generates samples from the correct marginal distribution of population parameters. Applied to actual data from closely related fruit fly species, it rapidly converged to posterior distributions that closely approximated the exact posteriors generated through massive computational effort. Applied to simulated data, it generated credible intervals that covered the actual parameter values in accordance with the nominal probabilities. AVAILABILITY: A C++ implementation of this method is freely accessible at http://www.isds.duke.edu/~scl13
Scotland C. Leman, Marcy K. Uyenoyama, Michael Lavine
Bioinform.3