Sciweavers

4085 search results - page 355 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ICML
2006
IEEE
16 years 5 months ago
Spectral clustering for multi-type relational data
Clustering on multi-type relational data has attracted more and more attention in recent years due to its high impact on various important applications, such as Web mining, e-comm...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
139
Voted
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 5 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
235
Voted
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 4 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
118
Voted
ICDM
2010
IEEE
125views Data Mining» more  ICDM 2010»
15 years 2 months ago
Evolving Ensemble-Clustering to a Feedback-Driven Process
Abstract--Data clustering is a highly used knowledge extraction technique and is applied in more and more application domains. Over the last years, a lot of algorithms have been pr...
Martin Hahmann, Dirk Habich, Wolfgang Lehner
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
15 years 8 months ago
Data Discretization Unification
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
Ruoming Jin, Yuri Breitbart, Chibuike Muoh