Sciweavers

3133 search results - page 99 / 627
» Representing clusters for retrieval
Sort
View
IJCAI
2007
15 years 3 months ago
Web Page Clustering Using Heuristic Search in the Web Graph
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
Ron Bekkerman, Shlomo Zilberstein, James Allan
EMMCVPR
2005
Springer
15 years 7 months ago
Retrieving Articulated 3-D Models Using Medial Surfaces and Their Graph Spectra
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
Juan Zhang, Kaleem Siddiqi, Diego Macrini, Ali Sho...
LATIN
2010
Springer
15 years 8 months ago
Kernelization through Tidying
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
René van Bevern, Hannes Moser, Rolf Niederm...
SIGIR
2005
ACM
15 years 7 months ago
Relation between PLSA and NMF and implications
Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as docum...
Éric Gaussier, Cyril Goutte
DGO
2008
128views Education» more  DGO 2008»
15 years 3 months ago
Ontology generation for large email collections
This paper presents a new approach to identifying concepts expressed in a collection of email messages, and organizing them into an ontology or taxonomy for browsing. It incorpora...
Hui Yang, Jamie Callan