1804 search results - page 230 / 361 » Ranking for data repairs |
156
click to vote
ICDM
2002
IEEE
15 years 9 months ago
2002
IEEE
Previous works on automatic query clustering most generate a flat, un-nested partition of query terms. In this work, we are pursuing to organize query terms into a hierarchical s...
129
click to vote
PAKDD
2010
ACM
15 years 9 months ago
2010
ACM
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
163
click to vote
ICAPR
2001
Springer
15 years 9 months ago
2001
Springer
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
137
click to vote
ICDAR
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper describes our investigation into the neural gas (NG) network algorithm and the hierarchical overlapped architecture (HONG) which we have built by retaining the essence ...
127
click to vote
DOLAP
2007
ACM
15 years 8 months ago
2007
ACM
Expressing preferences when querying databases is a natural way to avoid empty results and information flooding, and in general to rank results so that the user may first see the ...