Sciweavers

26 search results - page 4 / 6
» On Appropriate Assumptions to Mine Data Streams: Analysis an...
Sort
View
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
11 years 9 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
TMM
2008
167views more  TMM 2008»
13 years 7 months ago
Mining Appearance Models Directly From Compressed Video
In this paper, we propose an approach to learning appearance models of moving objects directly from compressed video. The appearance of a moving object changes dynamically in vide...
Datong Chen, Qiang Liu, Mingui Sun, Jie Yang
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
13 years 10 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 8 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter