Sciweavers

113 search results - page 4 / 23
» Efficient Discovery of Frequent Approximate Sequential Patte...
Sort
View
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
13 years 9 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
IDA
2011
Springer
13 years 2 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 11 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
HICSS
2006
IEEE
149views Biometrics» more  HICSS 2006»
14 years 1 months ago
An Efficient Heuristic Search for Real-Time Frequent Pattern Mining
Real-time frequent pattern mining for business intelligence systems are currently in the focal area of research. In a number of areas of doing business, especially in the arena of...
Rajanish Dass, Ambuj Mahanti
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
14 years 1 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han