Sciweavers

389 search results - page 3 / 78
» From Path Tree To Frequent Patterns: A Framework for Mining ...
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
13 years 11 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
13 years 9 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse
ADMA
2008
Springer
147views Data Mining» more  ADMA 2008»
14 years 3 days ago
Mining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Ro...
EUROCAST
2005
Springer
133views Hardware» more  EUROCAST 2005»
13 years 11 months ago
An Iterative Method for Mining Frequent Temporal Patterns
The incorporation of temporal semantic into the traditional data mining techniques has caused the creation of a new area called Temporal Data Mining. This incorporation is especial...
Francisco Guil, Antonio B. Bailón, Alfonso ...
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 6 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang