메뉴 건너뛰기




Volumn 4, Issue 11, 2011, Pages 714-725

On Link-based similarity join

Author keywords

[No Author keywords available]

Indexed keywords

AS-LINKS; BIOLOGICAL DATABASE; JOIN OPERATORS; LINK PREDICTION; LINK-BASED; NETWORK DATABASE; PERSONALIZED PAGERANK; SIMILARITY JOIN; SIMRANK; SPAM DETECTION;

EID: 84863753182     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402712     Document Type: Conference Paper
Times cited : (29)

References (22)
  • 1
    • 43449084967 scopus 로고    scopus 로고
    • A recommender system based on local random walks and spectral methods
    • Z. Abbassi and V. S. Mirrokni. A recommender system based on local random walks and spectral methods. In WebKDD/SNA-KDD, pages 102-108, 2007.
    • (2007) WebKDD/SNA-KDD , pp. 102-108
    • Abbassi, Z.1    Mirrokni, V.S.2
  • 2
    • 85104914015 scopus 로고    scopus 로고
    • Efficient exact set-similarity joins
    • A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918-929, 2006.
    • (2006) VLDB , pp. 918-929
    • Arasu, A.1    Ganti, V.2    Kaushik, R.3
  • 3
    • 0034831593 scopus 로고    scopus 로고
    • Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data
    • C. Boehm et al. Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data. In SIGMOD, pages 379-388, 2001.
    • (2001) SIGMOD , pp. 379-388
    • Boehm, C.1
  • 4
    • 77952275931 scopus 로고    scopus 로고
    • Fast computation of SimRank for static and dynamic information networks
    • C. Li et al. Fast computation of SimRank for static and dynamic information networks. In EDBT, pages 465-476, 2010.
    • (2010) EDBT , pp. 465-476
    • Li, C.1
  • 5
    • 57349141410 scopus 로고    scopus 로고
    • Efficient similarity joins for near duplicate detection
    • C. Xiao et al. Efficient similarity joins for near duplicate detection. In WWW, pages 131-140, 2008.
    • (2008) WWW , pp. 131-140
    • Xiao, C.1
  • 6
    • 84924122981 scopus 로고    scopus 로고
    • Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments
    • D. Fogaras et al. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Math., 2(3), 2005.
    • (2005) Internet Math , vol.2 , Issue.3
    • Fogaras, D.1
  • 7
    • 18744398132 scopus 로고    scopus 로고
    • The link prediction problem for social networks
    • D. Liben-Nowell et al. The link prediction problem for social networks. In CIKM, pages 556-559, 2003.
    • (2003) CIKM , pp. 556-559
    • Liben-Nowell, D.1
  • 8
    • 34250618778 scopus 로고    scopus 로고
    • Scaling link-based similarity search
    • D. Fogaras and B. Rácz. Scaling link-based similarity search. In WWW, pages 641-650, 2005.
    • (2005) WWW , pp. 641-650
    • Fogaras, D.1    Rácz, B.2
  • 9
    • 0242625250 scopus 로고    scopus 로고
    • SimRank: a measure of structuralcontext similarity
    • G. Jeh et al. SimRank: a measure of structuralcontext similarity. In KDD, pages 538-543, 2002.
    • (2002) KDD , pp. 538-543
    • Jeh, G.1
  • 10
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • W. Hoeffding. Probability inequalities for sums of bounded random variables. In Journal of the American Statistical Association, volume 58, pages 13-30, 1963.
    • (1963) Journal of the American Statistical Association , vol.58 , pp. 13-30
    • Hoeffding, W.1
  • 11
    • 0035789604 scopus 로고    scopus 로고
    • GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
    • J. Dittrich et al. GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces. In KDD, pages 47-56, 2001.
    • (2001) KDD , pp. 47-56
    • Dittrich, J.1
  • 12
    • 34547406735 scopus 로고    scopus 로고
    • Distance join queries on spatial networks
    • J. Sankaranarayanan et al. Distance join queries on spatial networks. In GIS, pages 211-218, 2006.
    • (2006) GIS , pp. 211-218
    • Sankaranarayanan, J.1
  • 13
    • 80053438862 scopus 로고    scopus 로고
    • Scaling personalized web search
    • G. Jeh and J. Widom. Scaling personalized web search. In WWW, pages 271-279, 2003.
    • (2003) WWW , pp. 271-279
    • Jeh, G.1    Widom, J.2
  • 14
    • 0033726520 scopus 로고    scopus 로고
    • The small-world phenomenon: an algorithm perspective
    • J. M. Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC, pages 163-170, 2000.
    • (2000) STOC , pp. 163-170
    • Kleinberg, J.M.1
  • 15
    • 79957815582 scopus 로고    scopus 로고
    • Distance-join: pattern match query in a large graph database
    • L. Zou et al. Distance-join: pattern match query in a large graph database. PVLDB, 2(1):886-897, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 886-897
    • Zou, L.1
  • 16
    • 75949090860 scopus 로고    scopus 로고
    • Accuracy estimate and optimization techniques for simrank computation
    • D. Lizorkin, P. Velikhov, M. Grinev, and D. Turdakov. Accuracy estimate and optimization techniques for simrank computation. VLDBJ, 19:45-66, 2010.
    • (2010) VLDBJ , vol.19 , pp. 45-66
    • Lizorkin, D.1    Velikhov, P.2    Grinev, M.3    Turdakov, D.4
  • 17
    • 82055180395 scopus 로고    scopus 로고
    • Fast single-pair simrank computation
    • P. Li et al. Fast single-pair simrank computation. In SDM, pages 571-582, 2010.
    • (2010) SDM , pp. 571-582
    • Li, P.1
  • 19
    • 77956202102 scopus 로고    scopus 로고
    • Fast nearest neighbor search in disk-resident graphs
    • P. Sarkar and A. Moore. Fast nearest neighbor search in disk-resident graphs. In KDD, pages 513-522, 2010.
    • (2010) KDD , pp. 513-522
    • Sarkar, P.1    Moore, A.2
  • 20
    • 84893853717 scopus 로고    scopus 로고
    • LinkClus: efficient clustering via heterogeneous semantic links
    • X. Yin et al. LinkClus: efficient clustering via heterogeneous semantic links. In VLDB, pages 427-438, 2006.
    • (2006) VLDB , pp. 427-438
    • Yin, X.1
  • 21
    • 77955045035 scopus 로고    scopus 로고
    • Graph clustering based on structural/attribute similarities
    • Y. Zhou et al. Graph clustering based on structural/attribute similarities. PVLDB, 2(1):718-729, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 718-729
    • Zhou, Y.1
  • 22
    • 85131818719 scopus 로고    scopus 로고
    • Combating web spam with trustrank
    • Z. Gyöngyi et al. Combating web spam with trustrank. In VLDB, pages 576-587, 2004.
    • (2004) VLDB , pp. 576-587
    • Gyöngyi, Z.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.