Summarization of Weighted Networks

[1]  Dragomir R. Radev,et al.  A survey of graphs in natural language processing* , 2015, Natural Language Engineering.

[2]  Jean-Marc Vincent,et al.  A Generic Algorithmic Framework to Solve Special Versions of the Set Partitioning Problem , 2014, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence.

[3]  Hannu Toivonen,et al.  Document summarization based on word associations , 2014, SIGIR.

[4]  Danai Koutra,et al.  Summarizing and understanding large graphs , 2014, Stat. Anal. Data Min..

[5]  Hannu Toivonen,et al.  The Use of Weighted Graphs for Large-Scale Genome Analysis , 2014, PloS one.

[6]  Luca Cagliero,et al.  GraphSum: Discovering correlations among multiple terms for graph-based summarization , 2013, Inf. Sci..

[7]  Qiang Qu,et al.  A direct mining approach to efficient constrained graph pattern discovery , 2013, SIGMOD '13.

[8]  Matheus Palhares Viana,et al.  On time-varying collaboration networks , 2013, J. Informetrics.

[9]  Hiroshi Mamitsuka,et al.  Mining from protein–protein interactions , 2012, WIREs Data Mining Knowl. Discov..

[10]  Stefanos Gritzalis,et al.  Privacy Preservation by k-Anonymization of Weighted Social Networks , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[11]  Christian Böhm,et al.  Summarization-based mining bipartite graphs , 2012, KDD.

[12]  Philip S. Yu,et al.  Magnet community identification on social networks , 2012, KDD.

[13]  Xin Wang,et al.  Query preserving graph compression , 2012, SIGMOD Conference.

[14]  Luciano da Fontoura Costa,et al.  Extractive summarization using complex networks and syntactic dependency , 2012 .

[15]  Hannu Toivonen,et al.  Biomine: predicting links between biological entities using network models of heterogeneous databases , 2012, BMC Bioinformatics.

[16]  Fang Zhou,et al.  Compression of weighted graphs , 2011, KDD.

[17]  Philip S. Yu,et al.  Mining top-K large structural patterns in a massive network , 2011, Proc. VLDB Endow..

[18]  Christian Böhm,et al.  Weighted Graph Compression for Parameter-free Clustering With PaCCo , 2011, SDM.

[19]  Huan Liu,et al.  Discovering Overlapping Groups in Social Media , 2010, 2010 IEEE International Conference on Data Mining.

[20]  Jiawei Han,et al.  Hierarchical Web-Page Clustering via In-Page and Cross-Page Link Structures , 2010, PAKDD.

[21]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[22]  Fang Zhou,et al.  A Framework for Path-Oriented Network Simplification , 2010, IDA.

[23]  Donald F. Towsley,et al.  Resisting structural re-identification in anonymized social networks , 2008, The VLDB Journal.

[24]  Masahiro Kimura,et al.  Learning Information Diffusion Model for Extracting Influential Nodes in a Social Network , 2010 .

[25]  Evimaria Terzi,et al.  GraSS: Graph Structure Summarization , 2010, SDM.

[26]  Jiawei Han,et al.  Parallel PathFinder Algorithms for Mining Structures from Graphs , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[27]  Balaraman Ravindran,et al.  Epsilon Equitable Partition: A positional analysis method for large social networks , 2009, COMAD.

[28]  Francisco Herrera,et al.  h-Index: A review focused in its variants, computation and standardization for different scientific fields , 2009, J. Informetrics.

[29]  Alberto Apostolico,et al.  Graph Compression by BFS , 2009, Algorithms.

[30]  Jiawei Han,et al.  Mining Graph Patterns Efficiently via Randomized Summaries , 2009, Proc. VLDB Endow..

[31]  Michael C. Schatz,et al.  Revealing Biological Modules via Graph Summarization , 2009, J. Comput. Biol..

[32]  Arindam Banerjee,et al.  Bayesian Co-clustering , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[33]  Philip S. Yu,et al.  Graph OLAP: Towards Online Analytical Processing on Graphs , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[34]  Hannu Toivonen,et al.  Finding reliable subgraphs from large probabilistic graphs , 2008, Data Mining and Knowledge Discovery.

[35]  Nisheeth Shrivastava,et al.  Graph summarization with bounded error , 2008, SIGMOD Conference.

[36]  Jignesh M. Patel,et al.  Efficient aggregation for graph summarization , 2008, SIGMOD Conference.

[37]  Roded Sharan,et al.  Biclustering Algorithms: A Survey , 2007 .

[38]  M. Newman,et al.  Vertex similarity in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Ulrich Elsner,et al.  Graph partitioning - a survey , 2005 .

[40]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[41]  Arlindo L. Oliveira,et al.  Biclustering algorithms for biological data analysis: a survey , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[42]  Anna C. Gilbert,et al.  Compressing Network Graphs , 2004 .

[43]  Inderjit S. Dhillon,et al.  Information-theoretic co-clustering , 2003, KDD '03.

[44]  Sepandar D. Kamvar,et al.  An Analytical Comparison of Approaches to Personalizing PageRank , 2003 .

[45]  Jennifer Widom,et al.  SimRank: a measure of structural-context similarity , 2002, KDD.

[46]  Raymie Stata,et al.  The Link Database: fast access to graphs of the Web , 2002, Proceedings DCC 2002. Data Compression Conference.

[47]  Micah Adler,et al.  Towards compressing Web graphs , 2001, Proceedings DCC 2001. Data Compression Conference.

[48]  S. Borgatti,et al.  Regular blockmodels of multiway, multimode matrices☆ , 1992 .

[49]  Uriel G. Rothblum,et al.  Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment , 1982 .

[50]  H. White,et al.  STRUCTURAL EQUIVALENCE OF INDIVIDUALS IN SOCIAL NETWORKS , 1977 .

[51]  Gerard Salton,et al.  A vector space model for automatic indexing , 1975, CACM.

[52]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .