Fetching the paper…
Reading the bibliography…
Most real systems consist of a large number of interacting, multi-typed components, while most contemporary researches model them as homogeneous networks, without distinguishing different types of objects and links in the networks.
S. Umeyama, “An eigendecomposition approach to weighted graph matching problems,” IEEE TPAMI , vol. 10, no. 5, pp. 695–703, 1988
1988
Earlier work this paper cites.
S. Wasserman, Social network analysis: Methods and applications . Cambridge university press, 1994
1994
Earlier work this paper cites.
G. Colliat, “Olap, relational, and multidimensional database systems,” ACM Sigmod Record , vol. 25, no. 3, pp. 64–69, 1996
1996
Earlier work this paper cites.
D. Jensen and H. Goldberg, AAAI Fall Symposium on AI and Link Analysis . AAAI Press, 1998
1998
Earlier work this paper cites.
S. Chakrabarti, B. Dom, and P. Indyk, “Enhanced hypertext categorization using hyperlinks,” ACM SIGMOD Record , vol. 27, no. 2, pp. 307–318, 1998
1998
Earlier work this paper cites.
L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: Bringing order to the web.” Technical report, Stanford University Database Group, 1998
1998
Earlier work this paper cites.
J. M. Kleinberg, “Authoritative sources in a hyperlinked environment,” in SODA , 1999, pp. 668–677
1999
Earlier work this paper cites.
D. J. Cook and L. B. Holder, “Graph-based data mining,” IEEE Intelligent Systems , vol. 15, no. 2, pp. 32–41, 2000
2000
Earlier work this paper cites.
J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 22, no. 8, pp. 888–905, 2000
2000
Earlier work this paper cites.
J. Lafferty, A. McCallum, and F. C. Pereira, “Conditional random fields: Probabilistic models for segmenting and labeling sequence data,” in ICML , 2001, pp. 282–289
2001
Earlier work this paper cites.
R. Feldman, “Link analysis: Current state of the art,” Tutorial at the KDD , vol. 2, 2002
2002
Earlier work this paper cites.
E. Otte and R. Rousseau, “Social network analysis: a powerful strategy, also for the information sciences,” Journal of information Science , vol. 28, no. 6, pp. 441–453, 2002
2002
Earlier work this paper cites.
S. Chakrabarti et al. , Mining the Web: Analysis of hypertext and semi structured data . Morgan Kaufmann, 2002
2002
Earlier work this paper cites.
G. Jeh and J. Widom, “Simrank: a measure of structural-context similarity,” in KDD , 2002, pp. 538–543
2002
Earlier work this paper cites.
S. Melnik, H. Garcia-Molina, and E. Rahm, “Similarity flooding: A versatile graph matching algorithm and its application to schema matching,” in ICDE , 2002, pp. 117–128
2002
Earlier work this paper cites.
D. Liben-Nowell and J. Kleinberg, “The link prediction problem for social networks,” in CIKM , 2003, pp. 556–559
2003
Earlier work this paper cites.
M. E. Newman, “The structure and function of complex networks,” SIAM review , vol. 45, no. 2, pp. 167–256, 2003
2003
Earlier work this paper cites.
G. Jeh and J. Widom, “Scaling personalized web search,” in WWW , 2003, pp. 271–279
2003
Earlier work this paper cites.
A. Popescul and L. H. Ungar, “Statistical relational learning for link prediction,” in IJCAI workshop on learning statistical models from relational data , 2003
2003
Earlier work this paper cites.
N. Srebro, T. Jaakkola et al. , “Weighted low-rank approximations,” in ICML , 2003, pp. 720–727
2003
Earlier work this paper cites.
M. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical review E , vol. 69, no. 2, p. 026113, 2004
2004
Earlier work this paper cites.
A. Doan, J. Madhavan, P. Domingos, and A. Halevy, “Ontology matching: A machine learning approach,” in Handbook on ontologies , 2004, pp. 385–403
2004
Earlier work this paper cites.
D. Gruhl, R. Guha, D. Liben-Nowell, and A. Tomkins, “Information diffusion through blogspace,” in WWW , 2004, pp. 491–501
2004
Earlier work this paper cites.
L. Getoor and C. P. Diehl, “Link mining: a survey,” SIGKDD Explorations , vol. 7, no. 2, pp. 3–12, 2005
2005
Earlier work this paper cites.
B. Long, Z. M. Zhang, and P. S. Yu, “Co-clustering by block value decomposition,” in KDD , 2005, pp. 635–640
2005
Earlier work this paper cites.
B. Long, X. Wu, Z. Zhang, and P. S. Yu, “Unsupervised learning on k-partite graphs,” in KDD , 2006, pp. 317–326
2006
Earlier work this paper cites.
F. M. Suchanek, G. Kasneci, and G. Weikum, “Yago: a core of semantic knowledge,” in WWW , 2007, pp. 697–706
2007
Earlier work this paper cites.
U. V. Luxburg, “A tutorial on spectral clustering,” Statistics and computing , vol. 17, no. 4, pp. 395–416, 2007
2007
Earlier work this paper cites.
K. Wakita and T. Tsurumi, “Finding community structure in mega-scale social networks,” in WWW , 2007, pp. 1275–1276
2007
Earlier work this paper cites.
M. Sales-Pardo, R. Guimera, A. Moreira, and L. Amaral, “Extracting the hierarchical organization of complex systems,” Proceedings of the National Academy of Sciences , vol. 104, no. 39, pp. 15 224–15 229, 2007
2007
Earlier work this paper cites.
D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social networks,” Journal of the American society for information science and technology , vol. 58, no. 7, pp. 1019–1031, 2007
2007
Earlier work this paper cites.
D. Zhou, S. A. Orshanskiy, H. Zha, and C. L. Giles, “Co-ranking authors and documents in a heterogeneous network,” in ICDM , 2007, pp. 739–744
2007
Earlier work this paper cites.
R. Singh, J. Xu, and B. Berger, “Pairwise global alignment of protein interaction networks by matching neighborhood topology,” in Research in computational molecular biology , 2007, pp. 16–31
2007
Earlier work this paper cites.
X. Yin, J. Han, and P. Yu, “Object distinction: Distinguishing objects with identical names,” in ICDE , 2007, pp. 1242–1246
2007
Earlier work this paper cites.
I. Bhattacharya and L. Getoor, “Collective entity resolution in relational data,” ACM Transactions on Knowledge Discovery from Data , vol. 1, no. 1, p. 5, 2007
2007
Earlier work this paper cites.
L. Tang, H. Liu, J. Zhang, and Z. Nazeri, “Community evolution in dynamic multi-mode networks,” in KDD , 2008, pp. 677–685
2008
Earlier work this paper cites.
J. Kim and T. Wilhelm, “What is a complex graph?” Physica A: Statistical Mechanics and its Applications , vol. 387, no. 11, pp. 2637–2652, 2008
2008
Earlier work this paper cites.
Q. Zhao, S. S. Bhowmick, X. Zheng, and K. Yi, “Characterizing and predicting community members from evolutionary and heterogeneous networks,” in CIKM , 2008, pp. 309–318
2008
Earlier work this paper cites.
M. Kalaev, V. Bafna, and R. Sharan, “Fast and accurate alignment of multiple protein networks,” in Research in Computational Molecular Biology , 2008, pp. 246–256
2008
Earlier work this paper cites.
J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su, “Arnetminer: extraction and mining of academic social networks,” in KDD , 2008, pp. 990–998
2008
Earlier work this paper cites.
X. Yin, J. Han, and P. S. Yu, “Truth discovery with multiple conflicting information providers on the web,” Knowledge and Data Engineering , vol. 20, no. 6, pp. 796–808, 2008
2008
Earlier work this paper cites.
J. Han, “Mining heterogeneous information networks by exploring the power of links,” in Discovery Science , 2009, pp. 13–30
2009
Earlier work this paper cites.
Y. Sun, J. Han, P. Zhao, Z. Yin, H. Cheng, and T. Wu, “RankClus: integrating clustering with ranking for heterogeneous information network analysis,” in EDBT , 2009, pp. 565–576
2009
Earlier work this paper cites.
Y. Sun, Y. Yu, and J. Han, “Ranking-based clustering of heterogeneous information networks with star network schema,” in KDD , 2009, pp. 797–806
2009
Earlier work this paper cites.
I. Konstas, V. Stathopoulo, and J. M. Jose, “On social networks and collaborative recommendation,” in SIGIR , 2009, pp. 195–202
2009
Earlier work this paper cites.
Y. Zhou, H. Cheng, and J. X. Yu, “Graph clustering based on structural/attribute similarities,” in VLDB , 2009, pp. 718–729
2009
Earlier work this paper cites.
T. Yang, R. Jin, Y. Chi, and S. Zhu, “Combining link and content for community detection: a discriminative approach,” in KDD , 2009, pp. 927–936
2009
Earlier work this paper cites.
H. Deng, M. R. Lyu, and I. King, “A generalized co-hits algorithm and its application to bipartite graphs,” in KDD , 2009, pp. 239–248
2009
Earlier work this paper cites.
H. Ma, I. King, and M. R. Lyu, “Learning to recommend with social trust ensemble,” in SIGIR , 2009, pp. 203–210
2009
Earlier work this paper cites.
C.-S. Liao, K. Lu, M. Baym, R. Singh, and B. Berger, “Isorankn: spectral methods for global alignment of multiple protein networks,” Bioinformatics , vol. 25, no. 12, pp. i253–i258, 2009
2009
Earlier work this paper cites.
G. W. Klau, “A new graph-based method for pairwise global network alignment,” BMC Bioinformatics , vol. 10, no. Suppl 1, p. S59, 2009
2009
Earlier work this paper cites.
J. Cohen, “Graph twiddling in a mapreduce world,” Computing in Science & Engineering , vol. 11, no. 4, pp. 29–41, 2009
2009
Earlier work this paper cites.
U. Kang, C. E. Tsourakakis, and C. Faloutsos, “Pegasus: A peta-scale graph mining system implementation and observations,” in ICDM , 2009, pp. 229–238
2009
Earlier work this paper cites.
R. N. Lichtenwalter, J. T. Lussier, and N. V. Chawla, “New perspectives and methods in link prediction,” in KDD , 2010, pp. 243–252
2010
Earlier work this paper cites.
V. Leroy, B. B. Cambazoglu, and F. Bonchi, “Cold start link prediction,” in KDD , 2010, pp. 393–402
2010
Earlier work this paper cites.
N. Lao and W. W. Cohen, “Relational retrieval using a combination of path-constrained random walks,” Machine Learning , vol. 81, no. 2, pp. 53–67, 2010
2010
Earlier work this paper cites.
N. Lao and W. Cohen, “Fast query execution for retrieval models based on path-constrained random walks,” in KDD , 2010, pp. 881–888
2010
Earlier work this paper cites.
A. K. Jain, “Data clustering: 50 years beyond k-means,” Pattern Recognition Letters , vol. 31, no. 8, pp. 651–666, 2010
2010
Earlier work this paper cites.
M. Ji, Y. Sun, M. Danilevsky, J. Han, and J. Gao, “Graph regularized transductive classification on heterogeneous information networks,” in ECML/PKDD , 2010, pp. 570–586
2010
Earlier work this paper cites.
C. Wang, J. Han, Y. Jia, J. Tang, D. Zhang, Y. Yu, and J. Guo, “Mining advisor-advisee relationships from research publication networks,” in KDD , 2010, pp. 203–212
2010
Earlier work this paper cites.
Y. Sun, J. Tang, J. Han, M. Gupta, and B. Zhao, “Community evolution detection in dynamic heterogeneous information networks,” in MLG , 2010, pp. 137–146
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
T. G. Lewis, Network science: Theory and applications . John Wiley & Sons, 2011
2011
Earlier work this paper cites.
Y. Sun, J. Han, X. Yan, P. Yu, and T. Wu, “Pathsim: Meta path-based top-k similarity search in heterogeneous information networks,” in VLDB , 2011, pp. 992–1003
2011
Cited alongside, same era.
C. Wang, R. Raina, D. Fong, D. Zhou, J. Han, and G. J. Badros, “Learning relevance from heterogeneous social network and its application in online targeting,” in SIGIR , 2011, pp. 655–664
2011
Cited alongside, same era.
C. Aggarwal, Y. Xie, and P. Yu, “Towards community detection in locally heterogeneous networks,” in SDM , 2011, pp. 391–402
2011
Cited alongside, same era.
H. Deng, J. Han, B. Zhao, Y. Yu, and C. X. Lin, “Probabilistic topic models with biased propagation on heterogeneous information networks,” in KDD , 2011, pp. 1271–1279
2011
Cited alongside, same era.
H. Deng, B. Zhao, and J. Han, “Collective topic modeling for heterogeneous networks,” in SIGIR , 2011, pp. 1109–1110
B. Wang, J. Tang, W. Fan, S. Chen, C. Tan, and Z. Yang, “Query-dependent cross-domain ranking in heterogeneous network,” Knowledge and information systems , vol. 34, no. 1, pp. 109–145, 2013
2013
Later among the works it cites.
D. Koutra, H. Tong, and D. Lubensky, “Big-align: Fast bipartite graph alignment,” in ICDM , 2013, pp. 389–398
2013
Later among the works it cites.
M. Danilevsky, C. Wang, F. Tao, S. Nguyen, G. Chen, N. Desai, L. Wang, and J. Han, “Amethyst: A system for mining and exploring topical hierarchies of heterogeneous data,” in KDD , 2013, pp. 1458–1461
2013
Later among the works it cites.
F. Tao, X. Yu, K. H. Lei, G. Brova, X. Cheng, J. Han, R. Kanade, Y. Sun, C. Wang, L. Wang et al. , “Research-insight: Providing insight on research by publication network analysis,” in SIGMOD , 2013, pp. 1093–1096
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
F. Alqadah and R. Bhatnagar, “A game theoretic framework for heterogenous information network clustering,” in KDD , 2011, pp. 795–804
2011
Cited alongside, same era.
Y. Sun, R. Barber, M. Gupta, C. C. Aggarwal, and J. Han, “Co-author relationship prediction in heterogeneous bibliographic networks,” in ASONAM , 2011, pp. 121–128
2011
Cited alongside, same era.
M. K. NG, X. Li, and Y. Ye, “Multirank: Co-ranking for objects and relations in multi-relational data,” in KDD , 2011, pp. 1217–1225
2011
Cited alongside, same era.
S. P. Ficklin and F. A. Feltus, “Gene coexpression network alignment and conservation of gene modules between two grass species: maize and rice,” Plant Physiology , vol. 156, no. 3, pp. 1244–1256, 2011
2011
Cited alongside, same era.
X. Jin, C. Wang, J. Luo, X. Yu, and J. Han, “Likeminer: a system for mining the power of’like’in social media networks,” in KDD , 2011, pp. 753–756
2011
Cited alongside, same era.
X. Jin, C. X. Lin, J. Luo, and J. Han, “Socialspamguard: A data mining-based spam detection system for social media networks,” in PVLDB , vol. 4, no. 12, 2011, pp. 1458–1461
2011
Cited alongside, same era.
P. Zhao, X. Li, D. Xin, and J. Han, “Graph cube: on warehousing and olap multidimensional networks,” in SIGMOD , 2011, pp. 853–864
2011
Cited alongside, same era.
Y. Li, C. Shi, S. Y. Philip, and Q. Chen, “Hrank: A path based ranking method in heterogeneous information network,” in WAIM , 2014, pp. 553–565
2014
Later among the works it cites.
H. Zhuang, J. Zhang, G. Brova, J. Tang, H. Cam, X. Yan, and J. Han, “Mining query-based subnetwork outliers in heterogeneous information networks,” in ICDM , 2014, pp. 1127–1132
2014
Later among the works it cites.
L. Zou, M. T. Özsu, L. Chen, X. Shen, R. Huang, and D. Zhao, “gstore: a graph-based SPARQL query engine,” VLDB Journal , vol. 23, no. 4, pp. 565–590, 2014
2014
Later among the works it cites.
X. Wu, X. Zhu, G.-Q. Wu, and W. Ding, “Data mining with big data,” IEEE Transactions on Knowledge & Data Engineering , vol. 26, no. 1, pp. 97–107, 2014
2014
Later among the works it cites.
J. He, J. Bailey, and R. Zhang, “Exploiting transitive similarity and temporal dynamics for similarity search in heterogeneous information networks,” Database Systems for Advanced Applications , vol. 8422, pp. 141–155, 2014
2014
Later among the works it cites.
L. Hou U., K. Yao, and H. Mak, “Pathsimext: Revisiting pathsim in heterogeneous information networks,” in WAIM , 2014, pp. 38–42
2014
Later among the works it cites.
C. Shi, X. Kong, Y. Huang, S. Y. Philip, and B. Wu, “Hetesim: A general framework for relevance measure in heterogeneous networks,” IEEE Transactions on Knowledge & Data Engineering , vol. 26, no. 10, pp. 2479–2492, 2014
2014
Later among the works it cites.
C. Li, J. Sun, Y. Xiong, and G. Zheng, “An efficient drug-target interaction mining algorithm in heterogeneous biological networks,” in PAKDD , 2014, pp. 65–76
2014
Later among the works it cites.
X. Meng, C. Shi, Y. Li, and B. W. Lei Zhang, “Relevance measure in large-scale heterogeneous networks,” in APWeb , 2014, pp. 636–643
2014
Later among the works it cites.
S. Bu, X. Hong, Z. Peng, and Q. Li, “Integrating meta-path selection with user-preference for top-k relevant search in heterogeneous information networks,” in CSCWD , 2014, pp. 301–306
2014
Later among the works it cites.
B. Boden, M. Ester, and T. Seidl, “Density-based subspace clustering in heterogeneous networks,” in ECML/PKDD , 2014, pp. 149–164
2014
Later among the works it cites.
C. Luo, W. Pang, and Z. Wang, “Semi-supervised clustering on heterogeneous information networks,” Advances in Knowledge Discovery and Data Mining , vol. 8444, pp. 548–559, 2014
2014
Later among the works it cites.
C. Shi, R. Wang, Y. Li, P. S. Yu, and B. Wu, “Ranking-based clustering on general heterogeneous information networks by network projection,” in CIKM , 2014, pp. 699–708
2014
Later among the works it cites.
C. Luo, R. Guan, Z. Wang, and C. Lin, “Hetpathmine: A novel transductive classification algorithm on heterogeneous information networks,” Advances in Information Retrieval , vol. 8416, pp. 210–221, 2014
2014
Later among the works it cites.
Y. Jacob, L. Denoyer, and P. Gallinari, “Learning latent representations of nodes for classifying in heterogeneous social networks,” in WSDM , 2014, pp. 373–382
2014
Later among the works it cites.
Y. Zhou and L. Liu, “Activity-edge centric multi-label classification for mining heterogeneous information networks,” in KDD , 2014, pp. 1276–1285
2014
Later among the works it cites.
S. Jendoubi, A. Martin, L. Lietard, and B. B. Yaghlane, “Classification of message spreading in a heterogeneous social network,” in IPMU , 2014, pp. 66–75
2014
Later among the works it cites.
B. Cao, X. Kong, and P. S. Yu, “Collective prediction of multiple types of links in heterogeneous information networks,” in ICDM , 2014, pp. 50–59
2014
Later among the works it cites.
J. Zhang, X. Kong, and P. S. Yu, “Transferring heterogeneous links across location-based social networks,” in WSDM , 2014, pp. 303–312
2014
Later among the works it cites.
C. C. Aggarwal, Y. Xie, and P. S. Yu, “A framework for dynamic link prediction in heterogeneous networks,” Statistical Analysis and Data Mining: The ASA Data Science Journal , vol. 7, no. 1, pp. 14–33, 2014
2014
Later among the works it cites.
X. Liu, Y. Yu, C. Guo, and Y. Sun, “Meta-path-based ranking with pseudo relevance feedback on heterogeneous graph for citation recommendation,” in CIKM , 2014, pp. 121–130
2014
Later among the works it cites.
M. H. Tsai, C. Aggarwal, and T. Huang, “Ranking in heterogeneous social media,” in WSDM , 2014, pp. 613–622
2014
Later among the works it cites.
J. Zhang, X. Kong, L. Jie, Y. Chang, and S. Y. Philip, “Ncr: A scalable network-based approach to co-ranking in question-and-answer sites,” in CIKM , 2014, pp. 709–718
2014
Later among the works it cites.
S. Wang, S. Xie, X. Zhang, Z. Li, P. S. Yu, and X. Shu, “Future influence ranking of scientific literature,” in SIAM , 2014, pp. 749–757
2014
Later among the works it cites.
X. Yu, X. Ren, Y. Sun, Q. Gu, B. Sturt, U. Khandelwal, B. Norick, and J. Han, “Personalized entity recommendation: A heterogeneous information network approach,” in WSDM , 2014, pp. 283–292
2014
Later among the works it cites.
R. Burke, F. Vahedian, and B. Mobasher, “Hybrid recommendation in heterogeneous networks,” in UMAP , 2014, pp. 49–60
2014
Later among the works it cites.
X. Ren, J. Liu, X. Yu, U. Khandelwal, Q. Gu, L. Wang, and J. Han, “Cluscite: Effective citation recommendation by information network-based clustering,” in KDD , 2014, pp. 821–830
2014
Later among the works it cites.
C. Luo, W. Pang, Z. Wang, and C. Lin, “Hete-cf: Social-based collaborative filtering recommendation using heterogeneous relations,” in ICDM , 2014, pp. 917–922
2014
Later among the works it cites.
J. Zhang, P. S. Yu, and Z.-H. Zhou, “Meta-path based multi-network collective link prediction,” in KDD , 2014, pp. 1286–1295
2014
Later among the works it cites.
S. Jin, J. Zhang, P. S. Yu, S. Yang, and A. Li, “Synergistic partitioning in multiple large scale social networks,” in IEEE BigData , 2014, pp. 281–290
2014
Later among the works it cites.
A. Zhang, X. Xie, K. C. C. Chang, C. A. Gunter, J. Han, and X. Wang, “Privacy risk in anonymized heterogeneous information networks.” in EDBT , 2014, pp. 595–606
2014
Later among the works it cites.
F. Tao, G. Brova, J. Han, H. Ji, C. Wang, B. Norick, A. El-Kishky, J. Liu, X. Ren, and Y. Sun, “Newsnetexplorer: automatic construction and exploration of news information networks,” in SIGMOD , 2014, pp. 1091–1094
2014
Later among the works it cites.
W. Shen, J. Han, and J. Wang, “A probabilistic model for linking named entities in web text with heterogeneous information networks,” in SIGMOD , 2014, pp. 1199–1210
2014
Later among the works it cites.
A. El-Kishky, Y. Song, C. Wang, C. R. Voss, and J. Han, “Scalable topical phrase mining from text corpora,” PVLDB , vol. 8, no. 3, pp. 305–316, 2014
2014
Later among the works it cites.
C. Shi, Z. Zhang, P. Luo, P. S. Yu, Y. Yue, and B. Wu, “Semantic path based personalized recommendation on weighted heterogeneous information networks,” in CIKM , 2015
2015
Closest in time.
Y. Xiong, Y. Zhu, and P. S. Yu, “Top-k similarity join in heterogeneous information networks,” IEEE Transactions on Knowledge & Data Engineering , vol. 27, no. 6, pp. 1710–1723, 2015
2015
Closest in time.
M. Zhu, T. Zhu, Z. Peng, G. Yang, Y. Xu, S. Wang, X. Wang, and X. Hong, “Relevance search on signed heterogeneous information network based on meta-path factorization,” in WAIM , 2015, pp. 181–192
2015
Closest in time.
M. Zhang, H. Hu, Z. He, and W. Wang, “Top-k similarity search in heterogeneous information networks with x-star network schema,” Expert Systems with Applications , vol. 42, no. 2, pp. 699–712, 2015
2015
Closest in time.
Q. Wang, Z. Peng, S. Wang, P. S. Yu, Q. Li, and X. Hong, “clutm: Content and link integrated topic model on heterogeneous information networks,” in WAIM , 2015, pp. 207–218
2015
Closest in time.
C. Wang, Y. Song, A. El-Kishky, D. Roth, M. Zhang, and J. Han, “Incorporating world knowledge to document clustering via heterogeneous information networks,” in KDD , 2015, pp. 1215–1224
2015
Closest in time.
J. Chen, W. Dai, Y. Sun, and J. Dy, “Clustering and ranking in heterogeneous information networks via gamma-poisson model,” in SDM , 2015, pp. 425–432
2015
Closest in time.
C. Qiu, W. Chen, T. Wang, and K. Lei, “Overlapping community detection in directed heterogeneous social network,” in WAIM , 2015, pp. 490–493
2015
Closest in time.
J. Kuck, H. Zhuang, X. Yan, H. Cam, and J. Han, “Query-based outlier detection in heterogeneous information networks,” in EDBT , 2015, pp. 325–336
2015
Closest in time.
J. Zhang, S. Y. Philip, and Y. Lv, “Organizational chart inference,” in KDD , 2015, pp. 1435–1444
2015
Closest in time.
F. Liu and S.-T. Xia, “Link prediction in aligned heterogeneous networks,” in PAKDD , 2015, pp. 33–44
2015
Closest in time.
Y. Zhang, J. Tang, Z. Yang, J. Pei, and P. S. Yu, “Cosnet: Connecting heterogeneous social networks with local and global consistency,” in KDD , 2015, pp. 1485–1494
2015
Closest in time.
J. Wu, L. Chen, Q. Yu, P. Han, and Z. Wu, “Trust-aware media recommendation in heterogeneous social networks,” World Wide Web , vol. 18, no. 1, pp. 139–157, 2015
2015
Closest in time.
C. Yang, J. Sun, J. Ma, S. Zhang, G. Wang, and Z. Hua, “Scientific collaborator recommendation in heterogeneous bibliographic networks,” in HICSS , 2015, pp. 552–561
2015
Closest in time.
J. Zhang, W. Shao, S. Wang, X. Kong, and P. Yu, “Partial network alignment with anchor meta path and truncated generalized stable matching,” in IRI , 2015
2015
Closest in time.
J. Zhang and P. Yu, “Integrated anchor and social link predictions across social networks,” in IJCAI , 2015
2015
Closest in time.
J. Zhang and P. S. Yu, “Multiple anonymized social networks alignment,” in ICDM , 2015
2015
Closest in time.
J. Zhang and P. Yu, “Community detection for emerging networks,” in SDM , 2015
2015
Closest in time.
Q. Zhan, J. Zhang, S. Wang, S. Y. Philip, and J. Xie, “Influence maximization across partially aligned heterogeneous social networks,” in PAKDD , 2015, pp. 58–69
2015
Closest in time.
J. Zhang and P. Yu, “Mcd: Mutual clustering across multiple heterogeneous networks,” in IEEE BigData Congress , 2015
2015
Closest in time.
J. Tang, M. Qu, and Q. Mei, “Pte: Predictive text embedding through large-scale heterogeneous text networks,” in KDD , 2015, pp. 1165–1174
2015
Closest in time.
X. Ren, A. El-Kishky, C. Wang, F. Tao, C. R. Voss, and J. Han, “Clustype: Effective entity recognition and typing by relation phrase-based clustering,” in KDD , 2015, pp. 995–1004
2015
Closest in time.
J. Liu, J. Shang, C. Wang, X. Ren, and J. Han, “Mining quality phrases from massive text corpora,” in SIGMOD , 2015, pp. 1729–1744
2015
Closest in time.
C. Meng, R. Cheng, S. Maniu, P. Senellart, and W. Zhang, “Discovering meta-paths in large heterogeneous information networks,” in WWW , 2015, pp. 754–764
2015
Closest in time.
X. Yu, Y. Sun, B. Norick, T. Mao, and J. Han, “User guided entity similarity search using meta-path selection in heterogeneous information networks,” in CIKM , 2012, pp. 2025–2029
2029
Closest in time.