Sciweavers

732 search results - page 12 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
ACMSE
2008
ACM
13 years 9 months ago
Mining frequent sequential patterns with first-occurrence forests
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
Erich Allen Peterson, Peiyi Tang
ICDM
2005
IEEE
153views Data Mining» more  ICDM 2005»
14 years 1 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
DKE
2008
113views more  DKE 2008»
13 years 7 months ago
An efficient algorithm for mining closed inter-transaction itemsets
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
Anthony J. T. Lee, Chun-sheng Wang, Wan-Yu Weng, Y...
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 9 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 9 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh