Sciweavers

126 search results - page 10 / 26
» kdd 2007
Sort
View
119
Voted
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
15 years 10 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
15 years 10 months ago
Efficient incremental constrained clustering
Clustering with constraints is an emerging area of data mining research. However, most work assumes that the constraints are given as one large batch. In this paper we explore the...
Ian Davidson, S. S. Ravi, Martin Ester
KDD
2007
ACM
122views Data Mining» more  KDD 2007»
15 years 10 months ago
Expertise modeling for matching papers with reviewers
An essential part of an expert-finding task, such as matching reviewers to submitted papers, is the ability to model the expertise of a person based on documents. We evaluate seve...
David M. Mimno, Andrew McCallum
KDD
2007
ACM
206views Data Mining» more  KDD 2007»
15 years 10 months ago
Automatic labeling of multinomial topic models
Multinomial distributions over words are frequently used to model topics in text collections. A common, major challenge in applying all such topic models to any text mining proble...
Qiaozhu Mei, Xuehua Shen, ChengXiang Zhai
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
15 years 10 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims