Sciweavers

1217 search results - page 17 / 244
» On compressing frequent patterns
Sort
View
134
Voted
DAWAK
2004
Springer
15 years 9 months ago
Mining Maximal Frequently Changing Subtree Patterns from XML Documents
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
211
Voted
IDA
2011
Springer
14 years 10 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, ...
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 3 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
123
Voted
AUSAI
2003
Springer
15 years 8 months ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
132
Voted
ICDM
2005
IEEE
153views Data Mining» more  ICDM 2005»
15 years 9 months ago
Privacy-Preserving Frequent Pattern Mining across Private Databases
Privacy consideration has much significance in the application of data mining. It is very important that the privacy of individual parties will not be exposed when data mining te...
Ada Wai-Chee Fu, Raymond Chi-Wing Wong, Ke Wang