Sciweavers

KDD
2004
ACM
209views Data Mining» more  KDD 2004»
14 years 10 months ago
Tracking dynamics of topic trends using a finite mixture model
In a wide range of business areas dealing with text data streams, including CRM, knowledge management, and Web monitoring services, it is an important issue to discover topic tren...
Satoshi Morinaga, Kenji Yamanishi
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 3 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 10 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 3 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 10 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
Data Mining
Top of PageReset Settings