1217 search results - page 41 / 244 » On compressing frequent patterns |
121
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
136
Voted
PAKDD
2007
ACM
15 years 9 months ago
2007
ACM
Abstract. We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions whose items are associated with existential...
124
click to vote
AINA
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call,...
107
click to vote
MLDM
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we show how frequent sequence mining (FSM) can be applied to data produced by monitoring distributed enterprise applications. In particular we show how we applied FSM...
109
Voted
TVLSI
2011
14 years 10 months ago
2011
Abstract—Bitstream compression is important in reconfigurable system design since it reduces the bitstream size and the memory requirement. It also improves the communication ba...