Sciweavers

184 search results - page 15 / 37
» Mining Quantitative Associations in Large Database
Sort
View
SIGMOD
2004
ACM
196views Database» more  SIGMOD 2004»
14 years 10 months ago
FARMER: Finding Interesting Rule Groups in Microarray Datasets
Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most e...
Gao Cong, Anthony K. H. Tung, Xin Xu, Feng Pan, Ji...
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
14 years 2 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 7 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
FQAS
2004
Springer
146views Database» more  FQAS 2004»
14 years 1 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
GIS
2006
ACM
14 years 11 months ago
Mining frequent geographic patterns with knowledge constraints
The large amount of patterns generated by frequent pattern mining algorithms has been extensively addressed in the last few years. In geographic pattern mining, besides the large ...
Luis Otávio Alvares, Paulo Martins Engel, S...