Sciweavers

4085 search results - page 23 / 817
» Benchmarking Data Mining Algorithms
Sort
View
NN
2006
Springer
113views Neural Networks» more  NN 2006»
13 years 7 months ago
Large-scale data exploration with the hierarchically growing hyperbolic SOM
We introduce the Hierarchically Growing Hyperbolic Self-Organizing Map (H2 SOM) featuring two extensions of the HSOM (hyperbolic SOM): (i) a hierarchically growing variant that al...
Jörg Ontrup, Helge Ritter
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
13 years 11 months ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang
JDCTA
2010
134views more  JDCTA 2010»
13 years 2 months ago
A New Clustering Segmentation Algorithm of 3D Medical Data Field Based on Data Mining
Direct 3D volume segmentation is one of the difficult and hot research fields in 3D medical data field processing. Using the clustering and analyzing techniques of data mining, a ...
Li Xinwu
KDD
2002
ACM
183views Data Mining» more  KDD 2002»
14 years 8 months ago
E-CAST: A Data Mining Algorithm for Gene Expression Data
Data clustering methods have been proven to be a successful data mining technique in the analysis of gene expression data. The Cluster affinity search technique (CAST) developed b...
Abdelghani Bellaachia, David Portnoy, Yidong Chen,...
PKDD
2000
Springer
159views Data Mining» more  PKDD 2000»
13 years 11 months ago
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda