Sciweavers

31 search results - page 4 / 7
» Clustering of Conceptual Graphs with Sparse Data
Sort
View
CIKM
2010
Springer
13 years 6 months ago
Building recommendation systems using peer-to-peer shared content
Peer-to-Peer (p2p) networks are used for sharing content by millions of users. Often, meta-data used for searching is missing or wrong, making it difficult for users to find cont...
Yuval Shavitt, Ela Weinsberg, Udi Weinsberg
CIKM
2009
Springer
14 years 2 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
NIPS
2001
13 years 8 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
EKAW
2000
Springer
13 years 11 months ago
KIDS: An Iterative Algorithm to Organize Relational Knowledge
The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of mos...
Isabelle Bournaud, Mélanie Courtine, Jean-D...
CIKM
2010
Springer
13 years 6 months ago
Hypergraph-based multilevel matrix approximation for text information retrieval
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
Haw-ren Fang, Yousef Saad