Sciweavers

4085 search results - page 289 / 817
» Benchmarking Data Mining Algorithms
Sort
View
SSDBM
2008
IEEE
177views Database» more  SSDBM 2008»
15 years 10 months ago
ELKI: A Software System for Evaluation of Subspace Clustering Algorithms
In order to establish consolidated standards in novel data mining areas, newly proposed algorithms need to be evaluated thoroughly. Many publications compare a new proposition – ...
Elke Achtert, Hans-Peter Kriegel, Arthur Zimek
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 4 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
16 years 5 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
15 years 10 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
CIKM
2004
Springer
15 years 9 months ago
Scalable sequential pattern mining for biological sequences
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
Ke Wang, Yabo Xu, Jeffrey Xu Yu