[1] 张建朋,等.基于采样的大规模图聚类分析算法[J].电子学报,2019,47(8):1731-1737. ZHANG Jian-Peng,et al.A sampling-based graph clustering algorithm for large-scale networks[J].Acta Electronica Sinica,2019,47(8):1731-1737.(in Chinese)
[2] 潘秋萍,游进国,等.图聚集技术的现状与挑战[J].软件学报,2015,26(1):167-177. Pan QiuPing,You JinGuo,et al.Progress and challenges of graph aggregation and summarization techniques[J].Journal of Software,2015,26(1):167-177.(in Chinese)
[3] Chen C,et al.Graph OLAP:towards online analytical processing on graphs[A].Proceedings of the International Conference on Data Mining[C].Pisa,Italy:IEEE,2008.103-112.
[4] Le Fevre K,Terzi E.GraSS:Graph structure summarization[A].Proceedings of the International Conference on Data Mining[C].Sydney,Australia:IEEE,2010.454-465.
[5] Navlakha S,Rastogi R,Shrivastava N.Graph summarization with bounded error[A].Proceedings of the International Conference on Management of Data[C].Vancouver,Canada:ACM,2008.419-432.
[6] 尹丹,高宏,邹兆年.一种新的高效图聚集算法[J].计算机研究与发展,2011,48(10):1831-1841. Yin Dan,Gao Hong,Zou ZhaoNian.A novel efficient graph aggregation algorithm[J].Journal of Computer Research and Development,2011,48(10):1831-1841.(in Chinese)
[7] Liu Z,Yu J X,Cheng H.Approximate homogeneous graph summarization[J].Journal of Information Processing,2011,20(1):77-88.
[8] Tian Y Y,Hankins R A,Patel J M.Efficient aggregation for graph summarization[A].Proceedings of the International Conference on Management of Data[C].Vancouver,BC,Canada:ACM,2008.419-432.
[9] Zhang N,Tian Y Y,Patel J M.Discovery-driven graph summarization[A].Proceedings of the International Conference on Data Engineering[C].Long Beach,USA:IEEE,2010.880-891.
[10] Toivonen H,Zhou F,Hartikainen A,et al.Compression of weighted graphs[A].Proceedings of the International Conference on Knowledge Discovery and Data Mining[C].San Diego,USA:ACM,2011.965-973.
[11] 胡宝丽,等.一种有效的加权图聚集算法[J].中国科学技术大学学报,2016,46(3):180-187. Hu BaoLi,et al.An efficient weighted graph aggregation algorithm[J].Journal of University of Science and Technology of China,2016,46(3):180-187.(in Chinese)
[12] Maserrat H,Pei J.Neighbor query friendly compression of social networks[A].Proceedings of the International Conference on Knowledge Discovery and Data Mining[C].Washington,DC,USA:ACM,2010.533-542.
[13] Van Schaik S J,De Moor O.A memory efficient reachability data structure through bit vector compression[A].Proceedings of the International Conference on Management of Data[C].Athens,Greece:ACM,2011.913-924.
[14] Ruan N,Jin R,Huang Y,Distance preserving graph simplification[A].Proceedings of the International Conference on Data Mining[C].Vancouver,Canada:IEEE,2011.1200-1205.
[15] Sadri A,et al.Shrink:Distance preservinggraph compression[J].Information Systems,2017,69:180-193.
[16] Chang L,Li W,Qin L,et al.PSCAN:Fast and exact structural graph clustering[J].IEEE Transactions on Knowledge and Data Engineering,2017,29(2):387-401. |