Sciweavers

460 search results - page 36 / 92
» An Index Structure for Data Mining and Clustering
Sort
View
MICAI
2004
Springer
14 years 1 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
EGICE
2006
13 years 11 months ago
Combining Two Data Mining Methods for System Identification
System identification is an abductive task which is affected by several kinds of modeling assumptions and measurement errors. Therefore, instead of optimizing values of parameters ...
Sandro Saitta, Benny Raphael, Ian F. C. Smith
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 7 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
ISMIS
2009
Springer
14 years 2 months ago
Discovering Structured Event Logs from Unstructured Audit Trails for Workflow Mining
Workflow mining aims to find graph-based process models based on activities, emails, and various event logs recorded in computer systems. Current workflow mining techniques mainly ...
Liqiang Geng, Scott Buffett, Bruce Hamilton, Xin W...
ICDM
2009
IEEE
133views Data Mining» more  ICDM 2009»
14 years 2 months ago
On K-Means Cluster Preservation Using Quantization Schemes
This work examines under what conditions compression methodologies can retain the outcome of clustering operations. We focus on the popular k-Means clustering algorithm and we dem...
Deepak S. Turaga, Michail Vlachos, Olivier Versche...