Sciweavers

138 search results - page 4 / 28
» Relational Frequent Patterns Mining for Novelty Detection fr...
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 8 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
WWW
2006
ACM
14 years 8 months ago
Online mining of frequent query trees over XML data streams
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...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
CIKM
2005
Springer
14 years 1 months ago
Novelty detection based on sentence level patterns
The detection of new information in a document stream is an important component of many potential applications. In this paper, a new novelty detection approach based on the identi...
Xiaoyan Li, W. Bruce Croft
CIKM
2006
Springer
13 years 11 months ago
Improving novelty detection for general topics using sentence level information patterns
The detection of new information in a document stream is an important component of many potential applications. In this work, a new novelty detection approach based on the identif...
Xiaoyan Li, W. Bruce Croft
PERCOM
2007
ACM
14 years 7 months ago
Mining Frequent Trajectory Patterns for Activity Monitoring Using Radio Frequency Tag Arrays
Activity monitoring, a crucial task in many applications, is often conducted expensively using video cameras. Also, effectively monitoring a large field by analyzing images from m...
Yunhao Liu, Lei Chen 0002, Jian Pei, Qiuxia Chen, ...