1217 search results - page 28 / 244 » On compressing frequent patterns |
131
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
113
Voted
HIS
2004
15 years 5 months ago
2004
Classification of large datasets is a challenging task in Data Mining. In the current work, we propose a novel method that compresses the data and classifies the test data directl...
133
Voted
DSD
2010
IEEE
15 years 2 months ago
2010
IEEE
— In this paper we propose a new method of test patterns compression based on a design of a dedicated SAT-based ATPG (Automatic Test Pattern Generator). This compression method i...
145
Voted
DIS
2004
Springer
15 years 7 months ago
2004
Springer
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
135
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...