Loading…
RoundTripRank: Graph-based proximity with importance and specificity?
Graph-based proximity has many applications with different ranking needs. However, most previous works only stress the sense of importance by finding "popular" results for a query. Often times important results are overly general without being well-tailored to the query, lacking a sense of...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 624 |
container_issue | |
container_start_page | 613 |
container_title | |
container_volume | |
creator | Yuan Fang Chang, K. C-C Lauw, H. W. |
description | Graph-based proximity has many applications with different ranking needs. However, most previous works only stress the sense of importance by finding "popular" results for a query. Often times important results are overly general without being well-tailored to the query, lacking a sense of specificity - which only emerges recently. Even then, the two senses are treated independently, and only combined empirically. In this paper, we generalize the well-studied importance-based random walk into a round trip and develop RoundTripRank, seamlessly integrating specificity and importance in one coherent process. We also recognize the need for a flexible trade-off between the two senses, and further develop RoundTripRank+ based on a scheme of hybrid random surfers. For efficient computation, we start with a basic model that decomposes RoundTripRank into smaller units. For each unit, we apply a novel two-stage bounds updating framework, enabling an online top-K algorithm 2SBound. Finally, our experiments show that RoundTripRank and RoundTripRank+ are robust over various ranking tasks, and 2SBound enables scalable online processing. |
doi_str_mv | 10.1109/ICDE.2013.6544860 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_6544860</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6544860</ieee_id><sourcerecordid>6544860</sourcerecordid><originalsourceid>FETCH-LOGICAL-i218t-38836e0f59b0508b8ed7facb6272979a49ae3238a2a6636f51a1d538de5da9263</originalsourceid><addsrcrecordid>eNpNkMtKxDAYheMNLGMfQNzkBVKT_E2auBGpdRwYEIYR3A1_m5SJ2gttReftLTgLz-Ysvo-zOIRcC54Iwe3tKn8sEskFJFqlqdH8hMQ2MyLVGaR2Nk5JJCFTjEv9dvafcQvnJBJcA9Ng5CWJx_Gdz7GpEIpHpNh0X63bDqHfYPtxR5cD9ntW4ugd7YfuJzRhOtDvMO1paPpumLCtPMXW0bH3VahDNfP7K3JR4-fo42MvyOtTsc2f2fplucof1ixIYSYGxoD2vFa25Iqb0niX1ViVWmbSZhZTix4kGJSoNehaCRROgXFeObRSw4Lc_O0G7_2uH0KDw2F3PAV-AbsmUKg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>RoundTripRank: Graph-based proximity with importance and specificity?</title><source>IEEE Xplore All Conference Series</source><creator>Yuan Fang ; Chang, K. C-C ; Lauw, H. W.</creator><creatorcontrib>Yuan Fang ; Chang, K. C-C ; Lauw, H. W.</creatorcontrib><description>Graph-based proximity has many applications with different ranking needs. However, most previous works only stress the sense of importance by finding "popular" results for a query. Often times important results are overly general without being well-tailored to the query, lacking a sense of specificity - which only emerges recently. Even then, the two senses are treated independently, and only combined empirically. In this paper, we generalize the well-studied importance-based random walk into a round trip and develop RoundTripRank, seamlessly integrating specificity and importance in one coherent process. We also recognize the need for a flexible trade-off between the two senses, and further develop RoundTripRank+ based on a scheme of hybrid random surfers. For efficient computation, we start with a basic model that decomposes RoundTripRank into smaller units. For each unit, we apply a novel two-stage bounds updating framework, enabling an online top-K algorithm 2SBound. Finally, our experiments show that RoundTripRank and RoundTripRank+ are robust over various ranking tasks, and 2SBound enables scalable online processing.</description><identifier>ISSN: 1063-6382</identifier><identifier>ISBN: 9781467349093</identifier><identifier>ISBN: 1467349097</identifier><identifier>EISSN: 2375-026X</identifier><identifier>EISBN: 9781467349109</identifier><identifier>EISBN: 1467349089</identifier><identifier>EISBN: 1467349100</identifier><identifier>EISBN: 9781467349086</identifier><identifier>DOI: 10.1109/ICDE.2013.6544860</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computational modeling ; Educational institutions ; Joining processes ; MIMICs ; Teleportation ; Uniform resource locators</subject><ispartof>2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013, p.613-624</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6544860$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6544860$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yuan Fang</creatorcontrib><creatorcontrib>Chang, K. C-C</creatorcontrib><creatorcontrib>Lauw, H. W.</creatorcontrib><title>RoundTripRank: Graph-based proximity with importance and specificity?</title><title>2013 IEEE 29th International Conference on Data Engineering (ICDE)</title><addtitle>ICDE</addtitle><description>Graph-based proximity has many applications with different ranking needs. However, most previous works only stress the sense of importance by finding "popular" results for a query. Often times important results are overly general without being well-tailored to the query, lacking a sense of specificity - which only emerges recently. Even then, the two senses are treated independently, and only combined empirically. In this paper, we generalize the well-studied importance-based random walk into a round trip and develop RoundTripRank, seamlessly integrating specificity and importance in one coherent process. We also recognize the need for a flexible trade-off between the two senses, and further develop RoundTripRank+ based on a scheme of hybrid random surfers. For efficient computation, we start with a basic model that decomposes RoundTripRank into smaller units. For each unit, we apply a novel two-stage bounds updating framework, enabling an online top-K algorithm 2SBound. Finally, our experiments show that RoundTripRank and RoundTripRank+ are robust over various ranking tasks, and 2SBound enables scalable online processing.</description><subject>Computational modeling</subject><subject>Educational institutions</subject><subject>Joining processes</subject><subject>MIMICs</subject><subject>Teleportation</subject><subject>Uniform resource locators</subject><issn>1063-6382</issn><issn>2375-026X</issn><isbn>9781467349093</isbn><isbn>1467349097</isbn><isbn>9781467349109</isbn><isbn>1467349089</isbn><isbn>1467349100</isbn><isbn>9781467349086</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpNkMtKxDAYheMNLGMfQNzkBVKT_E2auBGpdRwYEIYR3A1_m5SJ2gttReftLTgLz-Ysvo-zOIRcC54Iwe3tKn8sEskFJFqlqdH8hMQ2MyLVGaR2Nk5JJCFTjEv9dvafcQvnJBJcA9Ng5CWJx_Gdz7GpEIpHpNh0X63bDqHfYPtxR5cD9ntW4ugd7YfuJzRhOtDvMO1paPpumLCtPMXW0bH3VahDNfP7K3JR4-fo42MvyOtTsc2f2fplucof1ixIYSYGxoD2vFa25Iqb0niX1ViVWmbSZhZTix4kGJSoNehaCRROgXFeObRSw4Lc_O0G7_2uH0KDw2F3PAV-AbsmUKg</recordid><startdate>201304</startdate><enddate>201304</enddate><creator>Yuan Fang</creator><creator>Chang, K. C-C</creator><creator>Lauw, H. W.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201304</creationdate><title>RoundTripRank: Graph-based proximity with importance and specificity?</title><author>Yuan Fang ; Chang, K. C-C ; Lauw, H. W.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i218t-38836e0f59b0508b8ed7facb6272979a49ae3238a2a6636f51a1d538de5da9263</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computational modeling</topic><topic>Educational institutions</topic><topic>Joining processes</topic><topic>MIMICs</topic><topic>Teleportation</topic><topic>Uniform resource locators</topic><toplevel>online_resources</toplevel><creatorcontrib>Yuan Fang</creatorcontrib><creatorcontrib>Chang, K. C-C</creatorcontrib><creatorcontrib>Lauw, H. W.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore (Online service)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yuan Fang</au><au>Chang, K. C-C</au><au>Lauw, H. W.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>RoundTripRank: Graph-based proximity with importance and specificity?</atitle><btitle>2013 IEEE 29th International Conference on Data Engineering (ICDE)</btitle><stitle>ICDE</stitle><date>2013-04</date><risdate>2013</risdate><spage>613</spage><epage>624</epage><pages>613-624</pages><issn>1063-6382</issn><eissn>2375-026X</eissn><isbn>9781467349093</isbn><isbn>1467349097</isbn><eisbn>9781467349109</eisbn><eisbn>1467349089</eisbn><eisbn>1467349100</eisbn><eisbn>9781467349086</eisbn><abstract>Graph-based proximity has many applications with different ranking needs. However, most previous works only stress the sense of importance by finding "popular" results for a query. Often times important results are overly general without being well-tailored to the query, lacking a sense of specificity - which only emerges recently. Even then, the two senses are treated independently, and only combined empirically. In this paper, we generalize the well-studied importance-based random walk into a round trip and develop RoundTripRank, seamlessly integrating specificity and importance in one coherent process. We also recognize the need for a flexible trade-off between the two senses, and further develop RoundTripRank+ based on a scheme of hybrid random surfers. For efficient computation, we start with a basic model that decomposes RoundTripRank into smaller units. For each unit, we apply a novel two-stage bounds updating framework, enabling an online top-K algorithm 2SBound. Finally, our experiments show that RoundTripRank and RoundTripRank+ are robust over various ranking tasks, and 2SBound enables scalable online processing.</abstract><pub>IEEE</pub><doi>10.1109/ICDE.2013.6544860</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1063-6382 |
ispartof | 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013, p.613-624 |
issn | 1063-6382 2375-026X |
language | eng |
recordid | cdi_ieee_primary_6544860 |
source | IEEE Xplore All Conference Series |
subjects | Computational modeling Educational institutions Joining processes MIMICs Teleportation Uniform resource locators |
title | RoundTripRank: Graph-based proximity with importance and specificity? |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T08%3A12%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=RoundTripRank:%20Graph-based%20proximity%20with%20importance%20and%20specificity?&rft.btitle=2013%20IEEE%2029th%20International%20Conference%20on%20Data%20Engineering%20(ICDE)&rft.au=Yuan%20Fang&rft.date=2013-04&rft.spage=613&rft.epage=624&rft.pages=613-624&rft.issn=1063-6382&rft.eissn=2375-026X&rft.isbn=9781467349093&rft.isbn_list=1467349097&rft_id=info:doi/10.1109/ICDE.2013.6544860&rft.eisbn=9781467349109&rft.eisbn_list=1467349089&rft.eisbn_list=1467349100&rft.eisbn_list=9781467349086&rft_dat=%3Cieee_CHZPO%3E6544860%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i218t-38836e0f59b0508b8ed7facb6272979a49ae3238a2a6636f51a1d538de5da9263%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6544860&rfr_iscdi=true |