Sciweavers

5209 search results - page 362 / 1042
» Multiobjective Data Clustering
Sort
View
130
Voted
ICPR
2002
IEEE
16 years 6 months ago
Shape Representation Using Concavity Graphs
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
Ossama El Badawy, Mohamed Kamel
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 5 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
127
Voted
PKDD
2004
Springer
90views Data Mining» more  PKDD 2004»
15 years 10 months ago
Shape and Size Regularization in Expectation Maximization and Fuzzy Clustering
The more sophisticated fuzzy clustering algorithms, like the Gustafson–Kessel algorithm [11] and the fuzzy maximum likelihood estimation (FMLE) algorithm [10] offer the possibil...
Christian Borgelt, Rudolf Kruse
ACSAC
2001
IEEE
15 years 8 months ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
Klaus Julisch
143
Voted
SODA
2001
ACM
147views Algorithms» more  SODA 2001»
15 years 6 months ago
Sublinear time approximate clustering
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
Nina Mishra, Daniel Oblinger, Leonard Pitt