Sciweavers

11910 search results - page 1964 / 2382
» Online Learning Algorithms
Sort
View
KDD
2008
ACM
244views Data Mining» more  KDD 2008»
16 years 8 months ago
Probabilistic latent semantic visualization: topic model for visualizing documents
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
Tomoharu Iwata, Takeshi Yamada, Naonori Ueda
KDD
2007
ACM
198views Data Mining» more  KDD 2007»
16 years 8 months ago
Applying Link-Based Classification to Label Blogs
In analyzing data from social and communication networks, we encounter the problem of classifying objects where there is an explicit link structure amongst the objects. We study t...
Smriti Bhagat, Graham Cormode, Irina Rozenbaum
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
16 years 8 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
16 years 8 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
« Prev « First page 1964 / 2382 Last » Next »