Mixture Modeling with Pairwise, Instance-Level Class Constraints
From MaRDI portal
Publication:5699307
DOI10.1162/0899766054796914zbMATH Open1075.68636OpenAlexW2126367746WikidataQ51356612 ScholiaQ51356612MaRDI QIDQ5699307FDOQ5699307
Authors: Zhao Qi, David J. Miller
Publication date: 26 October 2005
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/0899766054796914
Recommendations
- Generalized mixture models, semi-supervised learning, and unknown class inference
- On a new evidential C-means algorithm with instance-level constraints
- Clustering with constraints: a mean-field approximation perspective
- Structural, Syntactic, and Statistical Pattern Recognition
- Pairwise contraints as priors in probabilistic clustering
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
Cited In (8)
- A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes
- Pairwise contraints as priors in probabilistic clustering
- Clustering with constraints: a mean-field approximation perspective
- Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
- Improved generative semisupervised learning based on finely grained component-conditional class labeling
- Gaussian mixture models with equivalence constraints
- Generalized mixture models, semi-supervised learning, and unknown class inference
- Hierarchical mixture models for biclustering in microarray data
This page was built for publication: Mixture Modeling with Pairwise, Instance-Level Class Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5699307)