Sciweavers

292 search results - page 17 / 59
» Scaling properties of the Internet graph
Sort
View
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
14 years 8 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
IOR
2011
175views more  IOR 2011»
13 years 2 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
ICDM
2009
IEEE
162views Data Mining» more  ICDM 2009»
14 years 2 months ago
Accurate Estimation of the Degree Distribution of Private Networks
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
Michael Hay, Chao Li, Gerome Miklau, David Jensen
SIGCOMM
2004
ACM
14 years 1 months ago
A first-principles approach to understanding the internet's router-level topology
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
Lun Li, David Alderson, Walter Willinger, John Doy...
ICML
2009
IEEE
14 years 8 months ago
Prototype vector machine for large scale semi-supervised learning
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
Kai Zhang, James T. Kwok, Bahram Parvin