Sciweavers

376 search results - page 26 / 76
» Efficient Indexing Structures for Mining Frequent Patterns
Sort
View
CIKM
1998
Springer
14 years 22 days ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
DKE
2006
157views more  DKE 2006»
13 years 8 months ago
XML structural delta mining: Issues and challenges
Recently, there is an increasing research efforts in XML data mining. These research efforts largely assumed that XML documents are static. However, in reality, the documents are ...
Qiankun Zhao, Ling Chen 0002, Sourav S. Bhowmick, ...
PODS
2009
ACM
134views Database» more  PODS 2009»
14 years 9 months ago
An efficient rigorous approach for identifying statistically significant frequent itemsets
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 10 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 9 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen