Sciweavers

376 search results - page 65 / 76
» Efficient Indexing Structures for Mining Frequent Patterns
Sort
View
DKE
2008
96views more  DKE 2008»
13 years 8 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
KDD
2009
ACM
257views Data Mining» more  KDD 2009»
14 years 3 months ago
Argo: intelligent advertising by mining a user's interest from his photo collections
In this paper, we introduce a system named Argo which provides intelligent advertising made possible from users’ photo collections. Based on the intuition that user-generated ph...
Xin-Jing Wang, Mo Yu, Lei Zhang, Rui Cai, Wei-Ying...
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
14 years 9 months ago
Clustering wavelets to speed-up data dissemination in structured P2P MANETs
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...
Mihai Lupu, Jianzhong Li, Beng Chin Ooi, Shengfei ...
DAWAK
2001
Springer
14 years 29 days ago
Determining the Convex Hull in Large Multidimensional Databases
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
Christian Böhm, Hans-Peter Kriegel
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
13 years 10 months ago
MACH: Fast Randomized Tensor Decompositions
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer visio...
Charalampos E. Tsourakakis