1217 search results - page 46 / 244 » On compressing frequent patterns |
140
Voted
IS
2007
15 years 3 months ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
123
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
125
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
136
Voted
APWEB
2006
Springer
15 years 7 months ago
2006
Springer
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...
126
click to vote
DAWAK
2010
Springer
15 years 4 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...