Sciweavers

709 search results - page 71 / 142
» Constraint-Based Pattern Set Mining
Sort
View
108
Voted
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
15 years 6 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
130
Voted
FQAS
2004
Springer
146views Database» more  FQAS 2004»
15 years 4 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
110
Voted
SDM
2008
SIAM
176views Data Mining» more  SDM 2008»
15 years 2 months ago
A General Model for Multiple View Unsupervised Learning
Multiple view data, which have multiple representations from different feature spaces or graph spaces, arise in various data mining applications such as information retrieval, bio...
Bo Long, Philip S. Yu, Zhongfei (Mark) Zhang
100
Voted
DAGSTUHL
2004
15 years 2 months ago
Knowledge-Based Sampling for Subgroup Discovery
Subgroup discovery aims at finding interesting subsets of a classified example set that deviates from the overall distribution. The search is guided by a so-called utility function...
Martin Scholz
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 29 days ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...