287 search results - page 42 / 58 » Coactive Learning for Distributed Data Mining |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
107
click to vote
SDM
2012
SIAM
13 years 5 days ago
2012
SIAM
: Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
In spite of the popularity of probabilistic mixture models for latent structure discovery from data, mixture models do not have a natural mechanism for handling sparsity, where ea...
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...