Sciweavers

4085 search results - page 388 / 817
» Benchmarking Data Mining Algorithms
Sort
View
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
16 years 5 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
15 years 11 months ago
Automatic Construction of N-ary Tree Based Taxonomies
Hierarchies are an intuitive and effective organization paradigm for data. Of late there has been considerable research on automatically learning hierarchical organizations of dat...
Kunal Punera, Suju Rajan, Joydeep Ghosh
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
15 years 2 months ago
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
Jennifer Neville, Brian Gallagher, Tina Eliassi-Ra...
CIKM
2010
Springer
15 years 3 months ago
CiteData: a new multi-faceted dataset for evaluating personalized search performance
Personalized search systems have evolved to utilize heterogeneous features including document hyperlinks, category labels in various taxonomies and social tags in addition to free...
Abhay Harpale, Yiming Yang, Siddharth Gopal, Daqin...
138
Voted
IPPS
1999
IEEE
15 years 9 months ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka