Sciweavers

1414 search results - page 226 / 283
» Relational peculiarity-oriented mining
Sort
View
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 9 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
14 years 9 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
14 years 9 months ago
On interactive visualization of high-dimensional data using the hyperbolic plane
: se the concept of visualizing general abstract data by intermediate projection into the hyperbolic space. Its favorable properties were reported earlier and led to the "hype...
Helge Ritter, Jörg A. Walter
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
14 years 9 months ago
Learning to recognize brain specific proteins based on low-level features from on-line prediction servers
During the last decade, the area of bioinformatics has produced an overwhelming amount of data, with the recently published draft of the human genome being the most prominent exam...
Henrik Boström, Joakim Cöster, Lars Aske...
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
14 years 9 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian