Graph Summarization with Quality Guarantees

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn 2015-January, Issue January, 2014, Pages 947-952

  Riondato, Matteo ^a   Garcia Soriano, David ^b   Bonchi, Francesco ^b  

^a STANFORD UNIVERSITY   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; K-MEANS CLUSTERING; POLYNOMIAL APPROXIMATION; QUERY PROCESSING;

EDGE DENSITIES; EDGE WEIGHTS; EXACT REPRESENTATIONS; GEOMETRIC CLUSTERING; LARGE GRAPHS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RECONSTRUCTION ERROR; WEIGHTED GRAPH;

DATA MINING;

EID: 84936944016     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2014.56     Document Type: Conference Paper

References (10)

1. K. LeFevre and E. Terzi, "GraSS: Graph structure summarization, " in SDM. SIAM, 2010, pp. 454-465.
2. S. Navlakha, R. Rastogi, and N. Shrivastava, "Graph summarization with bounded error, " in SIGMOD, 2008, pp. 419-432.
3. J. H. Ward, "Hierarchical grouping to optimize an objective function, " J. Amer. Statist. Assoc., vol. 58, no. 301, pp. 236-244, 1963.
4. K. Jain and V. V. Vazirani, " Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation," J. ACM, vol. 48, no. 2, pp. 274-296, 2001.
5. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, " Local search heuristics for k-median and facility location problems," SIAM J. Comput., vol. 33, no. 3, pp. 544-562, 2004.
6. P. Indyk, " Stable distributions, pseudorandom generators, embeddings, and data stream computation," J. ACM, vol. 53, no. 3, 2006.
7. R. R. Mettu and C. G. Plaxton, "The online median problem, " SIAM J. Comput., vol. 32, no. 3, pp. 816-832, 2003.
8. A. Aggarwal, A. Deshpande, and R. Kannan, "Adaptive sampling for k-means clustering, " in APPROX-RANDOM, 2009, pp. 15-28.
9. S. Lloyd, "Least squares quantization in PCM, " IEEE Trans. Inf. Theor., vol. 28, no. 2 , pp. 129-137, 1982.
10. D. Arthur,S. Vassilvitskii K-means++: the advantages of careful seeding in Proc. of 18th SODA 2007, 1027-1035.