Sciweavers

1246 search results - page 18 / 250
» High Performance Clustering Based on the Similarity Join
Sort
View
101
Voted
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
14 years 11 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
SBACPAD
2004
IEEE
106views Hardware» more  SBACPAD 2004»
14 years 11 months ago
High Performance Communication System Based on Generic Programming
This paper presents a high performance communication system based on generic programming. The system adapts itself according to the protocol being used on communication, simplifyi...
André Luís Gobbi Sanches, Fernando R...
91
Voted
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
15 years 10 months ago
Applying syntactic similarity algorithms for enterprise information management
: ? Applying Syntactic Similarity Algorithms for Enterprise Information Management Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph Tucek, Alistair Veitch HP Laborato...
Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey...
BPM
2009
Springer
161views Business» more  BPM 2009»
15 years 4 months ago
Trace Clustering Based on Conserved Patterns: Towards Achieving Better Process Models
Process mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms ...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...
JMLR
2006
108views more  JMLR 2006»
14 years 9 months ago
Learning Spectral Clustering, With Application To Speech Separation
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
Francis R. Bach, Michael I. Jordan