Sciweavers

227 search results - page 43 / 46
» Data and Structural k-Anonymity in Social Networks
Sort
View
CIKM
2009
Springer
13 years 11 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
230views Data Mining» more  ICDM 2008»
14 years 1 months ago
Evolutionary Clustering by Hierarchical Dirichlet Process with Hidden Markov State
This paper studies evolutionary clustering, which is a recently hot topic with many important applications, noticeably in social network analysis. In this paper, based on the rece...
Tianbing Xu, Zhongfei (Mark) Zhang, Philip S. Yu, ...
NSPW
2006
ACM
14 years 1 months ago
Sanitization models and their limitations
This work explores issues of computational disclosure control. We examine assumptions in the foundations of traditional problem statements and abstract models. We offer a comprehe...
Rick Crawford, Matt Bishop, Bhume Bhumiratana, Lis...
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
13 years 8 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 2 days 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 ...