메뉴 건너뛰기




Volumn , Issue , 2010, Pages 66-74

Discover hierarchical subgraphs with network-topology based ranking score

Author keywords

Eigen values; Graphs; Keyword search; Ranking

Indexed keywords

APPLICATION DOMAINS; EFFICIENT ALGORITHM; EIGEN-VALUE; EXPERIMENTAL ANALYSIS; GRAPHS; HIGHLY-CORRELATED; KEYWORD QUERIES; KEYWORD SEARCH; LINK STRUCTURE; PAGERANK ALGORITHM; PERFORMANCE PROBLEMS; RANKING; RANKING MEASURES; RELEVANCE SCORE; SEARCH SYSTEM; SOLUTION SET; STRUCTURED DATA; SUBGRAPHS; USER SATISFACTION;

EID: 77956255838     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1822327.1822336     Document Type: Conference Paper
Times cited : (1)

References (24)
  • 3
    • 34250655396 scopus 로고    scopus 로고
    • Finding k-dominant skylines in high dimensional space
    • C. Chan, H. V. Jagadish, T. K, A. Tung, and Z. Zhang. Finding k-dominant skylines in high dimensional space. In Proc. SIGMOD, pages 503-514, 2006.
    • (2006) Proc. SIGMOD , pp. 503-514
    • Chan, C.1    Jagadish, H.V.2    Tung, T.K.A.3    Zhang, Z.4
  • 6
    • 34247380937 scopus 로고    scopus 로고
    • Toward learning based web query processing
    • Y. Diao, H. Lu, S. Chen, and Z. Tian. Toward learning based web query processing. In Proc. VLDB, pages 317-328, 2000.
    • (2000) Proc. VLDB , pp. 317-328
    • Diao, Y.1    Lu, H.2    Chen, S.3    Tian, Z.4
  • 7
    • 85135989264 scopus 로고    scopus 로고
    • Accurate and efficient crawling for relevant websites
    • M. Ester, H. Kriegel, and M. Schubert. Accurate and efficient crawling for relevant websites. In Proc. VLDB, pages 396-407, 2004.
    • (2004) Proc. VLDB , pp. 396-407
    • Ester, M.1    Kriegel, H.2    Schubert, M.3
  • 11
    • 0042349490 scopus 로고    scopus 로고
    • Effectively finding relevant web pages from linkage information
    • J. Hou and Y. Zhang. Effectively finding relevant web pages from linkage information. In IEEE TKDE, pages 940-951, 2003.
    • (2003) IEEE TKDE , pp. 940-951
    • Hou, J.1    Zhang, Y.2
  • 14
    • 34250642809 scopus 로고    scopus 로고
    • Finding and approximating top-k answers in keyword proximity search
    • B. Kimelfeld and Y. Sagiv. Finding and approximating top-k answers in keyword proximity search. In PODS '06, pages 173-182, 2006.
    • (2006) PODS '06 , pp. 173-182
    • Kimelfeld, B.1    Sagiv, Y.2
  • 15
    • 85011088600 scopus 로고    scopus 로고
    • Matching twigs in probabilistic xml
    • B. Kimelfeld and Y. Sagiv. Matching twigs in probabilistic xml. In Proc. VLDB, pages 27-38, 2007.
    • (2007) Proc. VLDB , pp. 27-38
    • Kimelfeld, B.1    Sagiv, Y.2
  • 16
    • 33751241157 scopus 로고    scopus 로고
    • A reordering for the pagerank problem
    • A. N. Langville and C. D. Meyer. A reordering for the pagerank problem. SIAM J. Sci. Comput., 27(6):2112-2120, 2006.
    • (2006) SIAM J. Sci. Comput. , vol.27 , Issue.6 , pp. 2112-2120
    • Langville, A.N.1    Meyer, C.D.2
  • 17
    • 57149125295 scopus 로고    scopus 로고
    • Ease: An effective 3-in-1 keyword search method for unstructured, semi-structured and structured data
    • G. Li, B. C. Ooi, J. Feng, J. Wang, and L. Zhou. Ease: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In SIGMOD '08, pages 903-914, 2008.
    • (2008) SIGMOD '08 , pp. 903-914
    • Li, G.1    Ooi, B.C.2    Feng, J.3    Wang, J.4    Zhou, L.5
  • 18
    • 85013624238 scopus 로고    scopus 로고
    • Retrieving and organizing web pages by "information unit"
    • W.-S. Li, K. S. Candan, Q. Vu, and D. Agrawal. Retrieving and organizing web pages by "information unit". In WWW '01, pages 230-244, 2001.
    • (2001) WWW '01 , pp. 230-244
    • Li, W.-S.1    Candan, K.S.2    Vu, Q.3    Agrawal, D.4
  • 20
    • 33744985238 scopus 로고    scopus 로고
    • Optimal website reorganization considering information overload and search depth
    • C. Lin. Optimal website reorganization considering information overload and search depth. EJOR, pages 839-848, 2006.
    • (2006) EJOR , pp. 839-848
    • Lin, C.1
  • 21
    • 1142279455 scopus 로고    scopus 로고
    • An optimal and progressive algorithm for skyline queries
    • D. Papadias, Y. Tao, G. Fu, and B. Seeger. An optimal and progressive algorithm for skyline queries. In SIGMOD '03, pages 467-478, 2003.
    • (2003) SIGMOD '03 , pp. 467-478
    • Papadias, D.1    Tao, Y.2    Fu, G.3    Seeger, B.4
  • 22
    • 84930064585 scopus 로고    scopus 로고
    • Hierarchical organization in complex networks
    • E. Ravasz and A. Barabasi. Hierarchical organization in complex networks. Physical Review, 2003.
    • (2003) Physical Review
    • Ravasz, E.1    Barabasi, A.2


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