Sciweavers

1364 search results - page 110 / 273
» Sampling Methods for Unsupervised Learning
Sort
View
ICML
2001
IEEE
16 years 3 months ago
Constrained K-means Clustering with Background Knowledge
Clustering is traditionally viewed as an unsupervised method for data analysis. However, in some cases information about the problem domain is available in addition to the data in...
Kiri Wagstaff, Claire Cardie, Seth Rogers, Stefan ...
SDM
2004
SIAM
225views Data Mining» more  SDM 2004»
15 years 4 months ago
Active Semi-Supervision for Pairwise Constrained Clustering
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
Sugato Basu, Arindam Banerjee, Raymond J. Mooney
AAAI
1996
15 years 4 months ago
Sequential Inductive Learning
This article advocates a new model for inductive learning. Called sequential induction, it helps bridge classical fixed-sample learning techniques (which are efficient but difficu...
Jonathan Gratch
MM
2005
ACM
134views Multimedia» more  MM 2005»
15 years 8 months ago
Formulating context-dependent similarity functions
Tasks of information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be formulated in a con...
Gang Wu, Edward Y. Chang, Navneet Panda
NIPS
2008
15 years 4 months ago
DiscLDA: Discriminative Learning for Dimensionality Reduction and Classification
Probabilistic topic models have become popular as methods for dimensionality reduction in collections of text documents or images. These models are usually treated as generative m...
Simon Lacoste-Julien, Fei Sha, Michael I. Jordan