Sciweavers

1314 search results - page 35 / 263
» Approximate data mining in very large relational data
Sort
View
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 5 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
15 years 7 months ago
Cross-Mining Binary and Numerical Attributes
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
Gemma C. Garriga, Hannes Heikinheimo, Jouni K. Sep...
WWW
2004
ACM
16 years 2 months ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey
SDM
2004
SIAM
225views Data Mining» more  SDM 2004»
15 years 2 months ago
Active Semi-Supervision for Pairwise Constrained Clustering
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
Sugato Basu, Arindam Banerjee, Raymond J. Mooney
INCDM
2010
Springer
486views Data Mining» more  INCDM 2010»
15 years 3 months ago
Finding Temporal Patterns in Noisy Longitudinal Data: A Study in Diabetic Retinopathy
This paper describes an approach to temporal pattern mining using the concept of user de ned temporal prototypes to de ne the nature of the trends of interests. The temporal patt...
Vassiliki Somaraki, Deborah Broadbent, Frans Coene...