Sciweavers

63 search results - page 8 / 13
» Top-k Set Similarity Joins
Sort
View
MTA
2007
141views more  MTA 2007»
13 years 7 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
SIGIR
2012
ACM
11 years 10 months ago
Top-k learning to rank: labeling, ranking and evaluation
In this paper, we propose a novel top-k learning to rank framework, which involves labeling strategy, ranking model and evaluation measure. The motivation comes from the difficul...
Shuzi Niu, Jiafeng Guo, Yanyan Lan, Xueqi Cheng
SIGMOD
2010
ACM
174views Database» more  SIGMOD 2010»
14 years 9 days ago
Sampling dirty data for matching attributes
We investigate the problem of creating and analyzing samples of relational databases to find relationships between string-valued attributes. Our focus is on identifying attribute...
Henning Köhler, Xiaofang Zhou, Shazia Wasim S...
TKDE
2012
253views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
Carlos Ordonez, Zhibo Chen 0002
ICTAI
2009
IEEE
14 years 2 months ago
FlockStream: A Bio-Inspired Algorithm for Clustering Evolving Data Streams
Existing density-based data stream clustering algorithms use a two-phase scheme approach consisting of an online phase, in which raw data is processed to gather summary statistics...
Agostino Forestiero, Clara Pizzuti, Giandomenico S...