Sciweavers

4536 search results - page 278 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
PKDD
2005
Springer
122views Data Mining» more  PKDD 2005»
16 years 5 days ago
A Probabilistic Clustering-Projection Model for Discrete Data
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
CIKM
2006
Springer
15 years 8 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
CIKM
2006
Springer
15 years 10 months ago
Adaptive non-linear clustering in data streams
Data stream clustering has emerged as a challenging and interesting problem over the past few years. Due to the evolving nature, and one-pass restriction imposed by the data strea...
Ankur Jain, Zhihua Zhang, Edward Y. Chang
ICDE
1999
IEEE
118views Database» more  ICDE 1999»
16 years 8 months ago
Maintaining Data Cubes under Dimension Updates
OLAP systems support data analysis through a multidimensional data model, according to which data facts are viewed as points in a space of application-related dimensions", or...
Carlos A. Hurtado, Alberto O. Mendelzon, Alejandro...
166
Voted
WWW
2006
ACM
16 years 7 months ago
Mining clickthrough data for collaborative web search
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...