Sciweavers

4085 search results - page 268 / 817
» Benchmarking Data Mining Algorithms
Sort
View
EDBT
2008
ACM
122views Database» more  EDBT 2008»
16 years 4 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
149
Voted
ADMA
2009
Springer
145views Data Mining» more  ADMA 2009»
15 years 10 months ago
A Framework for Multi-Objective Clustering and Its Application to Co-Location Mining
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...
Rachsuda Jiamthapthaksin, Christoph F. Eick, Ricar...
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
15 years 1 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
134
Voted
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
15 years 9 months ago
Learning to predict train wheel failures
This paper describes a successful but challenging application of data mining in the railway industry. The objective is to optimize maintenance and operation of trains through prog...
Chunsheng Yang, Sylvain Létourneau
PVLDB
2008
107views more  PVLDB 2008»
15 years 3 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald