Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarina Meila
Person information
- affiliation: University of Washington, Seattle, WA, USA
- affiliation (former): Massachusetts Institute of Technology, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1999
[b1]Marina Meila-Predoviciu:
Learning with Mixtures of Trees. Massachusetts Institute of Technology, Cambridge, MA, USA, 1999
Journal Articles
- 2023
- [j16]Nikolaos Evangelou
, Felix Dietrich, Eliodoro Chiavazzo, Daniel Lehmberg, Marina Meila, Ioannis G. Kevrekidis:
Double Diffusion Maps and their Latent Harmonics for scientific computations in latent space. J. Comput. Phys. 485: 112072 (2023) - 2022
- [j15]Samson J. Koelle, Hanyu Zhang, Marina Meila, Yu-Chia Chen:
Manifold Coordinates with Physical Meaning. J. Mach. Learn. Res. 23: 133:1-133:57 (2022) - [j14]Marina Meila, Annelise Wagner, Christopher Meek:
Recursive inversion models for permutations. Stat. Comput. 32(4): 54 (2022) - 2019
- [j13]Marina Meila:
Good (K-means) clusterings are unique (up to small perturbations). J. Multivar. Anal. 173: 1-17 (2019) - 2016
- [j12]James McQueen, Marina Meila, Jacob VanderPlas, Zhongyue Zhang:
Megaman: Scalable Manifold Learning in Python. J. Mach. Learn. Res. 17: 148:1-148:5 (2016) - [j11]Marina Meila, Harr Chen:
Bayesian Non-Parametric Clustering of Ranking Data. IEEE Trans. Pattern Anal. Mach. Intell. 38(11): 2156-2169 (2016) - 2012
- [j10]Marina Meila:
Local equivalences of distances between clusterings - a geometric perspective. Mach. Learn. 86(3): 369-389 (2012) - [j9]Alnur Ali, Marina Meila:
Experiments with Kemeny ranking: What works when? Math. Soc. Sci. 64(1): 28-40 (2012) - 2010
- [j8]Marina Meila, Le Bao:
An Exponential Model for Infinite Rankings. J. Mach. Learn. Res. 11: 3481-3518 (2010) - 2007
- [j7]Anamika Sarkar, Marina Meila, B. Robert Franza:
IκB, NF-κB Regulation Model: Simulation Analysis of Small Number of Molecules. EURASIP J. Bioinform. Syst. Biol. 2007 (2007) - 2006
- [j6]Salvador Ruiz-Correa, Linda G. Shapiro, Marina Meila, Gabriel Berson, Michael L. Cunningham, Raymond W. Sze:
Symbolic Signatures for Deformable Shapes. IEEE Trans. Pattern Anal. Mach. Intell. 28(1): 75-90 (2006) - [j5]Marina Meila, Tommi S. Jaakkola:
Tractable Bayesian learning of tree belief networks. Stat. Comput. 16(1): 77-92 (2006) - [j4]Anne Patrikainen, Marina Meila:
Comparing Subspace Clusterings. IEEE Trans. Knowl. Data Eng. 18(7): 902-916 (2006) - 2004
- [j3]Cody C. T. Kwok, Dieter Fox, Marina Meila:
Real-time particle filters. Proc. IEEE 92(3): 469-484 (2004) - 2001
- [j2]Marina Meila, David Heckerman:
An Experimental Comparison of Model-Based Clustering Methods. Mach. Learn. 42(1/2): 9-29 (2001) - 2000
- [j1]Marina Meila, Michael I. Jordan:
Learning with Mixtures of Trees. J. Mach. Learn. Res. 1: 1-48 (2000)
Conference and Workshop Papers
- 2021
- [c42]Yu-Chia Chen, Marina Meila:
The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian. NeurIPS 2021: 15695-15709 - 2019
- [c41]Yu-Chia Chen, Marina Meila:
Selecting the independent coordinates of manifolds with large aspect ratios. NeurIPS 2019: 1086-1095 - 2018
- [c40]Marina Meila:
How to tell when a clustering is (approximately) correct using convex relaxations. NeurIPS 2018: 7418-7429 - 2017
- [c39]Dominique Joncas, Marina Meila, James McQueen:
Improved Graph Laplacian via Geometric Self-Consistency. NIPS 2017: 4457-4466 - 2016
- [c38]Yali Wan, Marina Meila:
Benchmarking recovery theorems for the DC-SBM. ISAIM 2016 - [c37]Yali Wan, Marina Meila:
Graph Clustering: Block-models and model free results. NIPS 2016: 2478-2486 - [c36]James McQueen, Marina Meila, Dominique Joncas:
Nearly Isometric Embedding by Relaxation. NIPS 2016: 2631-2639 - 2015
- [c35]Yali Wan, Marina Meila:
A class of network models recoverable by spectral clustering. NIPS 2015: 3285-3293 - 2014
- [c34]Christopher Meek, Marina Meila:
Recursive Inversion Models for Permutations. NIPS 2014: 631-639 - 2013
- [c33]Raman Arora, Marina Meila:
Consensus Ranking with Signed Permutations. AISTATS 2013: 117-125 - 2011
- [c32]Dominique C. Perrault-Joncas, Marina Meila:
Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators. NIPS 2011: 990-998 - 2010
- [c31]Dominique C. Perrault-Joncas, Marina Meila, Marc Scott:
Building a Job Lanscape from Directional Transition Data. AAAI Fall Symposium: Manifold Learning and Its Applications 2010 - [c30]Marina Meila, Harr Chen:
Dirichlet Process Mixtures of Generalized Mallows Models. UAI 2010: 358-367 - [c29]Tommi S. Jaakkola, David A. Sontag, Amir Globerson, Marina Meila:
Learning Bayesian Network Structure using LP Relaxations. AISTATS 2010: 358-365 - 2009
- [c28]Bhushan Mandhani, Marina Meila:
Tractable Search for Learning Exponential Models of Rankings. AISTATS 2009: 392-399 - 2008
- [c27]Marina Meila, Caren Marzban, Ulvi Yurtsever:
Gravimetric Detection by Compressed Sensing. IGARSS (2) 2008: 193-196 - [c26]Marina Meila, Le Bao:
Estimation and clustering with infinite rankings. UAI 2008: 393-402 - 2007
- [c25]Marina Meila, William Pentney:
Clustering by weighted cuts in directed graphs. SDM 2007: 135-144 - [c24]Marina Meila, Kapil Phadnis, Arthur Patterson, Jeff A. Bilmes:
Consensus ranking under the exponential model. UAI 2007: 285-294 - [c23]Marina Meila, Xiaotong Shen:
Preface. AISTATS 2007: 1-2 - 2006
- [c22]Marina Meila:
The uniqueness of a good optimum for K-means. ICML 2006: 625-632 - 2005
- [c21]William Pentney, Marina Meila:
Spectral Clustering of Biological Sequence Data. AAAI 2005: 845-850 - [c20]Marina Meila, Susan M. Shortreed, Liang Xu:
Regularized spectral learning. AISTATS 2005 - [c19]Marina Meila:
Comparing clusterings: an axiomatic view. ICML 2005: 577-584 - [c18]Susan M. Shortreed, Marina Meila:
Unsupervised Spectral Learning. UAI 2005: 534-541 - 2003
- [c17]Marina Meila:
Data centering in feature space. AISTATS 2003 - [c16]Marina Meila:
Comparing Clusterings by the Variation of Information. COLT 2003: 173-187 - [c15]Salvador Ruiz-Correa, Linda G. Shapiro, Marina Meila:
A New Paradigm for Recognizing 3-D Object Shapes from Range Data. ICCV 2003: 1126-1133 - [c14]Cody C. T. Kwok, Dieter Fox, Marina Meila:
Adaptive real-time particle filters for robot localization. ICRA 2003: 2836-2841 - [c13]Salvador Ruiz-Correa, Linda G. Shapiro, Marina Meila, Gabriel Berson:
Discriminating Deformable Shape Classes. NIPS 2003: 1491-1498 - 2002
- [c12]Cody C. T. Kwok, Dieter Fox, Marina Meila:
Real-Time Particle Filters. NIPS 2002: 1057-1064 - 2001
- [c11]Marina Meila, Jianbo Shi:
A Random Walks View of Spectral Segmentation. AISTATS 2001 - [c10]Salvador Ruiz-Correa, Linda G. Shapiro, Marina Meila:
A New Signature-Based Method for Efficient 3-D Object Recognition. CVPR (1) 2001: 769-776 - [c9]Jeff A. Bilmes, Gang Ji, Marina Meila:
Intransitive Likelihood-Ratio Classifiers. NIPS 2001: 1141-1148 - 2000
- [c8]Marina Meila, Jianbo Shi:
Learning Segmentation by Random Walks. NIPS 2000: 873-879 - [c7]Marina Meila, Tommi S. Jaakkola:
Tractable Bayesian Learning of Tree Belief Networks. UAI 2000: 380-388 - 1999
- [c6]Marina Meila:
An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High-Dimensional Sparse Data. ICML 1999: 249-257 - [c5]Tommi S. Jaakkola, Marina Meila, Tony Jebara:
Maximum Entropy Discrimination. NIPS 1999: 470-476 - 1998
- [c4]Marina Meila, David Heckerman:
An Experimental Comparison of Several Clustering and Initialization Methods. UAI 1998: 386-395 - 1997
- [c3]Marina Meila, Michael I. Jordan:
Estimating Dependency Structure as a Hidden Variable. NIPS 1997: 584-590 - 1996
- [c2]Marina Meila, Michael I. Jordan:
Triangulation by Continuous Embedding. NIPS 1996: 557-563 - 1995
- [c1]Marina Meila, Michael I. Jordan:
Learning Fine Motion by Markov Mixtures of Experts. NIPS 1995: 1003-1009
Editorship
- 2021
- [e3]Marina Meila, Tong Zhang:
Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event. Proceedings of Machine Learning Research 139, PMLR 2021 [contents] - 2015
- [e2]Marina Meila, Tom Heskes:
Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI 2015, July 12-16, 2015, Amsterdam, The Netherlands. AUAI Press 2015, ISBN 978-0-9966431-0-8 [contents] - 2007
- [e1]Marina Meila, Xiaotong Shen:
Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, AISTATS 2007, San Juan, Puerto Rico, March 21-24, 2007. JMLR Proceedings 2, JMLR.org 2007 [contents]
Informal and Other Publications
- 2023
- [i24]Hanyu Zhang, Marina Meila:
The Parametric Stability of Well-separated Spherical Gaussian Mixtures. CoRR abs/2302.00242 (2023) - [i23]Hanyu Zhang, Samson J. Koelle, Marina Meila:
Dictionary-based Manifold Learning. CoRR abs/2302.00263 (2023) - [i22]Marina Meila, Hanyu Zhang:
Manifold learning: what, how, and why. CoRR abs/2311.03757 (2023) - 2022
- [i21]Charvi Rastogi, Ivan Stelmakh, Xinwei Shen, Marina Meila, Federico Echenique, Shuchi Chawla, Nihar B. Shah:
To ArXiv or not to ArXiv: A Study Quantifying Pros and Cons of Posting Preprints Online. CoRR abs/2203.17259 (2022) - [i20]Nikolaos Evangelou, Felix Dietrich, Eliodoro Chiavazzo, Daniel Lehmberg, Marina Meila, Ioannis G. Kevrekidis:
Double Diffusion Maps and their Latent Harmonics for Scientific Computations in Latent Space. CoRR abs/2204.12536 (2022) - 2021
- [i19]Yu-Chia Chen, Marina Meila, Ioannis G. Kevrekidis:
Helmholtzian Eigenmap: Topological feature discovery & edge flow learning from point cloud data. CoRR abs/2103.07626 (2021) - [i18]Yali Wan, Marina Meila:
A class of network models recoverable by spectral clustering. CoRR abs/2104.10347 (2021) - [i17]Yu-Chia Chen, Marina Meila:
The decomposition of the higher-order homology embedding constructed from the k-Laplacian. CoRR abs/2107.10970 (2021) - [i16]Marina Meila, Hanyu Zhang:
Distribution free optimality intervals for clustering. CoRR abs/2107.14442 (2021) - 2020
- [i15]Marina Meila:
Guarantees for Hierarchical Clustering by the Sublevel Set method. CoRR abs/2006.10274 (2020) - 2019
- [i14]Yali Wan, Marina Meila:
Measuring the Robustness of Graph Properties. CoRR abs/1901.09661 (2019) - [i13]Yu-Chia Chen, Marina Meila:
Selecting the independent coordinates of manifolds with large aspect ratios. CoRR abs/1907.01651 (2019) - 2018
- [i12]Marina Meila:
How to sample connected K-partitions of a graph. CoRR abs/1808.00050 (2018) - [i11]Marina Meila, Samson J. Koelle, Hanyu Zhang:
A regression approach for explaining manifold embedding coordinates. CoRR abs/1811.11891 (2018) - 2016
- [i10]James McQueen, Marina Meila, Jacob VanderPlas, Zhongyue Zhang:
megaman: Manifold Learning with Millions of points. CoRR abs/1603.02763 (2016) - 2014
- [i9]Dominique C. Perrault-Joncas, Marina Meila:
Estimating Vector Fields on Manifolds and the Embedding of Directed Graphs. CoRR abs/1406.0013 (2014) - [i8]Dominique C. Perrault-Joncas, Marina Meila:
Improved graph Laplacian via geometric self-consistency. CoRR abs/1406.0118 (2014) - [i7]Zaeem Hussain, Marina Meila:
Graph Sensitive Indices for Comparing Clusterings. CoRR abs/1411.7582 (2014) - 2013
- [i6]Marina Meila, Tommi S. Jaakkola:
Tractable Bayesian Learning of Tree Belief Networks. CoRR abs/1301.3875 (2013) - [i5]Marina Meila, David Heckerman:
An Experimental Comparison of Several Clustering and Initialization Methods. CoRR abs/1301.7401 (2013) - 2012
- [i4]Marina Meila, Harr Chen:
Dirichlet Process Mixtures of Generalized Mallows Models. CoRR abs/1203.3496 (2012) - [i3]Marina Meila, Le Bao:
Estimation and Clustering with Infinite Rankings. CoRR abs/1206.3270 (2012) - [i2]Marina Meila, Kapil Phadnis, Arthur Patterson, Jeff A. Bilmes:
Consensus ranking under the exponential model. CoRR abs/1206.5265 (2012) - [i1]Susan M. Shortreed, Marina Meila:
Unsupervised spectral learning. CoRR abs/1207.1358 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 18:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
