1217 search results - page 44 / 244 » On compressing frequent patterns |
134
Voted
ISCI
2008
15 years 3 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
132
Voted
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
112
Voted
AUSDM
2007
Springer
15 years 9 months ago
2007
Springer
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
127
click to vote
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
120
Voted
PAKDD
2004
ACM
15 years 9 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...