1217 search results - page 137 / 244 » On compressing frequent patterns |
139
click to vote
KDID
2004
15 years 5 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
127
click to vote
IVC
2002
15 years 3 months ago
2002
This paper addresses the problem of automatically extracting frequently used pedestrian pathways from video sequences of natural outdoor scenes. Path models are learnt from the ac...
144
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
160
click to vote
IWCIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
138
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
Word meaning disambiguation has always been an important problem in many computer science tasks, such as information retrieval and extraction. One of the problems, faced in automa...