SPORE: shortest path overlapped regions and confined traversals towards graph clustering

[1]  Amos Fiat,et al.  Highway Dimension and Provably Efficient Shortest Path Algorithms , 2016, J. ACM.

[2]  Andrew V. Goldberg,et al.  Robust Exact Distance Queries on Massive Networks , 2014 .

[3]  Christian Sommer,et al.  Shortest-path queries in static networks , 2014, ACM Comput. Surv..

[4]  Edith Cohen,et al.  Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths , 2013, COSN '13.

[5]  Hung-Hsuan Chen,et al.  ASCOS: An Asymmetric network Structure COntext Similarity measure , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[6]  Sibo Wang,et al.  Efficient single-source shortest path and distance queries on large graphs , 2013, KDD.

[7]  Anu Pradhan,et al.  Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms , 2013, J. Comput. Civ. Eng..

[8]  Takuya Akiba,et al.  Fast exact shortest-path distance queries on large networks by pruned landmark labeling , 2013, SIGMOD '13.

[9]  Shuigeng Zhou,et al.  Shortest path and distance queries on road networks: towards bridging theory and practice , 2013, SIGMOD '13.

[10]  Andrew V. Goldberg,et al.  Hierarchical Hub Labelings for Shortest Paths , 2012, ESA.

[11]  Peter Sanders,et al.  Exact Routing in Large Road Networks Using Contraction Hierarchies , 2012, Transp. Sci..

[12]  Young-Koo Lee,et al.  Collaborative Similarity Measure for Intra Graph Clustering , 2012, DASFAA Workshops.

[13]  Jeffrey Xu Yu,et al.  Relational Approach for Shortest Path Discovery over Large Graphs , 2011, Proc. VLDB Endow..

[14]  Hong Cheng,et al.  Clustering Large Attributed Graphs: A Balance between Structural and Attribute Similarities , 2011, TKDD.

[15]  Peter Sanders,et al.  Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.

[16]  Dorothea Wagner,et al.  Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126] , 2009, Algorithmics of Large and Complex Networks.

[17]  Hans-Peter Kriegel,et al.  Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering , 2009, TKDD.

[18]  Peter Sanders,et al.  Fast Routing in Road Networks with Transit Nodes , 2007, Science.

[19]  Christos Faloutsos,et al.  Fast Random Walk with Restart and Its Applications , 2006, Sixth International Conference on Data Mining (ICDM'06).

[20]  Peter Sanders,et al.  Engineering highway hierarchies , 2006, JEAL.

[21]  Carlos Ordonez,et al.  Integrating K-means clustering with a relational DBMS using SQL , 2006, IEEE Transactions on Knowledge and Data Engineering.

[22]  Sergios Theodoridis,et al.  Pattern Recognition, Third Edition , 2006 .

[23]  Haim Kaplan,et al.  Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.

[24]  Christos Faloutsos,et al.  Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication , 2005, PKDD.

[25]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[26]  Jon Kleinberg,et al.  The link prediction problem for social networks , 2003, CIKM '03.

[27]  Lada A. Adamic,et al.  How to search a social network , 2003, Soc. Networks.

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

[29]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[30]  Charles Elkan,et al.  Scalability for clustering algorithms revisited , 2000, SKDD.

[31]  S. Dongen.  Graph clustering by flow simulation , 2000 .

[32]  Paul S. Bradley,et al.  Scaling Clustering Algorithms to Large Databases , 1998, KDD.

[33]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[34]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[35]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[36]  Charu C. Aggarwal,et al.  Frequent Pattern Mining Algorithms: A Survey , 2014, Frequent Pattern Mining.

[37]  James T. Halbert,et al.  Scalable Graph Clustering with Pregel , 2013, CompleNet.

[38]  Robin Wilson,et al.  Modern Graph Theory , 2013 .

[39]  Georgia Koutrika,et al.  A Survey on Proximity Measures for Social Networks , 2012, SeCO Book.

[40]  Srinivasan Parthasarathy,et al.  Scalable clustering of modern networks , 2012 .

[41]  Greg Hamerly,et al.  Making k-means Even Faster , 2010, SDM.

[42]  Satu Elisa Schaeffer,et al.  Survey Graph clustering , 2007 .

[43]  J. Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[44]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[45]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[46]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .