1217 search results - page 21 / 244 » On compressing frequent patterns |
96
Voted
PAKDD
2005
ACM
15 years 9 months ago
2005
ACM
In this paper we extend the state-of-art of the constraints that can be pushed in a frequent pattern computation. We introduce a new class of tough constraints, namely Loose Anti-m...
129
Voted
DAWAK
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
150
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
160
Voted
EWSN
2008
Springer
16 years 3 months ago
2008
Springer
Today it is possible to deploy sensor networks in the real world and collect large amounts of raw sensory data. However, it remains a major challenge to make sense of sensor data, ...
143
click to vote
EUROCAST
2005
Springer
15 years 9 months ago
2005
Springer
The incorporation of temporal semantic into the traditional data mining techniques has caused the creation of a new area called Temporal Data Mining. This incorporation is especial...