Sciweavers

DIS
2007
Springer
13 years 8 months ago
Efficient Incremental Mining of Top-K Frequent Closed Itemsets
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
Andrea Pietracaprina, Fabio Vandin
SIGMOD
1997
ACM
148views Database» more  SIGMOD 1997»
13 years 8 months ago
Beyond Market Baskets: Generalizing Association Rules to Correlations
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confi...
Sergey Brin, Rajeev Motwani, Craig Silverstein
VLDB
1998
ACM
147views Database» more  VLDB 1998»
13 years 8 months ago
Scalable Techniques for Mining Causal Structures
Mining for association rules in market basket data has proved a fruitful areaof research. Measures such as conditional probability (confidence) and correlation have been used to i...
Craig Silverstein, Sergey Brin, Rajeev Motwani, Je...
VLDB
1999
ACM
188views Database» more  VLDB 1999»
13 years 8 months ago
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
DAWAK
1999
Springer
13 years 8 months ago
Mining Interval Time Series
Data mining can be used to extensively automate the data analysis process. Techniques for mining interval time series, however, have not been considered. Such time series are commo...
Roy Villafane, Kien A. Hua, Duc A. Tran, Basab Mau...
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
13 years 8 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
13 years 9 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
ADBIS
2001
Springer
115views Database» more  ADBIS 2001»
13 years 9 months ago
Interactive Constraint-Based Sequential Pattern Mining
Data mining is an interactive and iterative process. It is very likely that a user will execute a series of similar queries differing in pattern constraints and mining parameters,...
Marek Wojciechowski
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
13 years 9 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
ICDM
2002
IEEE
108views Data Mining» more  ICDM 2002»
13 years 9 months ago
Mining Association Rules from Stars
Association rule mining is an important data mining problem. It is found to be useful for conventional relational data. However, previous work has mostly targeted on mining a sing...
Eric Ka Ka Ng, Ada Wai-Chee Fu, Ke Wang