Sciweavers

180 search results - page 31 / 36
» A Method for Change Computation in Deductive Databases
Sort
View
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
14 years 6 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
EDBT
2009
ACM
302views Database» more  EDBT 2009»
14 years 1 months ago
RankClus: integrating clustering with ranking for heterogeneous information network analysis
As information networks become ubiquitous, extracting knowledge from information networks has become an important task. Both ranking and clustering can provide overall views on in...
Yizhou Sun, Jiawei Han, Peixiang Zhao, Zhijun Yin,...
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
14 years 7 days ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 4 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
ICIP
2003
IEEE
14 years 8 months ago
Fast indexing for image retrieval based on local appearance with re-ranking
This paper describes an approach to retrieve images containing specific objects, scenes or buildings. The image content is captured by a set of local features. More precisely, we ...
Hao Shao, Tomás Svoboda, Vittorio Ferrari, ...