Sciweavers

4085 search results - page 190 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ICDM
2008
IEEE
80views Data Mining» more  ICDM 2008»
15 years 10 months ago
Collective Latent Dirichlet Allocation
In this paper, we propose a new variant of Latent Dirichlet Allocation(LDA): Collective LDA (C-LDA), for multiple corpora modeling. C-LDA combines multiple corpora during learning...
Zhiyong Shen, Jun Sun, Yi-Dong Shen
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 3 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
168
Voted
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
13 years 5 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
133
Voted
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
15 years 1 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
KDD
1997
ACM
106views Data Mining» more  KDD 1997»
15 years 7 months ago
Clustering Sequences of Complex Objects
Sequential Data This paper is about the unsuperviseddiscovery of patterns in sequencesof compositeobjects. A compositeobject may be describedas a sequenceof other, simpler data. In...
A. Ketterlin