Sciweavers

1861 search results - page 262 / 373
» 1.6-Bit Pattern Databases
Sort
View
KDD
2008
ACM
244views Data Mining» more  KDD 2008»
15 years 10 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
167views Data Mining» more  KDD 2007»
15 years 10 months ago
Multiscale topic tomography
Modeling the evolution of topics with time is of great value in automatic summarization and analysis of large document collections. In this work, we propose a new probabilistic gr...
Ramesh Nallapati, Susan Ditmore, John D. Lafferty,...
KDD
2005
ACM
181views Data Mining» more  KDD 2005»
15 years 10 months ago
Evaluating similarity measures: a large-scale study in the orkut social network
Online information services have grown too large for users to navigate without the help of automated tools such as collaborative filtering, which makes recommendations to users ba...
Ellen Spertus, Mehran Sahami, Orkut Buyukkokten
KDD
2004
ACM
302views Data Mining» more  KDD 2004»
15 years 10 months ago
Redundancy based feature selection for microarray data
In gene expression microarray data analysis, selecting a small number of discriminative genes from thousands of genes is an important problem for accurate classification of diseas...
Lei Yu, Huan Liu
KDD
2003
ACM
135views Data Mining» more  KDD 2003»
15 years 10 months ago
Efficiently handling feature redundancy in high-dimensional data
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining....
Lei Yu, Huan Liu