1217 search results - page 81 / 244 » On compressing frequent patterns |
141
click to vote
VLDB
1993
ACM
15 years 8 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
128
click to vote
DEXA
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we present a novel frequent generalized pattern mining algorithm, called GP-Close, for mining generalized associations from RDF metadata. To solve the overgeneraliz...
156
Voted
DASFAA
2007
IEEE
2007
IEEE
LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases
15 years 10 months ago
Sequential pattern mining is very important because it is the basis of many applications. Although there has been a great deal of effort on sequential pattern mining in recent year...
147
click to vote
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
In this paper, we present a framework for mining diverging patterns, a new type of contrast patterns whose frequency changes significantly differently in two data sets, e.g., it c...
144
Voted
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
Design patterns are solutions to recurring design problems, conceived to increase benefits in terms of reuse, code quality and, above all, maintainability and resilience to change...