Sciweavers

156 search results - page 20 / 32
» Structure of Neighborhoods in a Large Social Network
Sort
View
CIKM
2009
Springer
15 years 3 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
15 years 6 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
15 years 6 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 4 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 3 days ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni