Sciweavers

800 search results - page 136 / 160
» Ranking refinement and its application to information retrie...
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
WWW
2008
ACM
14 years 8 months ago
A framework for fast community extraction of large-scale networks
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
Yutaka I. Leon-Suematsu, Kikuo Yuta
WWW
2008
ACM
14 years 8 months ago
A generic framework for collaborative multi-perspective ontology acquisition
The research objective of this work is to develop a general framework that incorporates collaborative social tagging with a novel ontology scheme conveying multiple perspectives. ...
Maayan Zhitomirsky-Geffet, Judit Bar-Ilan, Yitzcha...
COCOON
2005
Springer
14 years 1 months ago
A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
Zhixiang Chen, Bin Fu
SPIRE
2005
Springer
14 years 1 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez