Sciweavers

115 search results - page 16 / 23
» Mining, Indexing, and Similarity Search in Graphs and Comple...
Sort
View
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
15 years 4 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
15 years 11 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
CIKM
2007
Springer
15 years 3 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
15 years 3 months ago
SAXually Explicit Images: Finding Unusual Shapes
Among the visual features of multimedia content, shape is of particular interest because humans can often recognize objects solely on the basis of shape. Over the past three decad...
Li Wei, Eamonn J. Keogh, Xiaopeng Xi
LREC
2010
144views Education» more  LREC 2010»
14 years 11 months ago
Evaluating Complex Semantic Artifacts
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
Christopher R. Walker, Hannah Copperman