Efficient network aware search in collaborative tagging sites

Sihem Amer Yahia, Michael Benedikt, Laks V.S. Lakshmanan, Julia Stoyanovich

    Research output: Contribution to journalArticle

    Abstract

    The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network of taggers related to a seeker. In this paper, we present the first in-depth study of network-aware search. We investigate efficient top-k processing when the score of an answer is computed as its popularity among members of a seeker's network. We argue that obvious adaptations of top-k algorithms are too space-intensive, due to the dependence of scores on the seeker's network. We therefore develop algorithms based on maintaining score upper-bounds. The global upper-bound approach maintains a single score upper-bound for every pair of item and tag, over the entire collection of users. The resulting bounds are very coarse. We thus investigate clustering seekers based on similar behavior of their networks. We show that finding the optimal clustering of seekers is intractable, but we provide heuristic methods that give substantial time improvements. We then give an optimization that can benefit smaller populations of seekers based on clustering of taggers. Our results are supported by extensive experiments on del.icio.us datasets.

    Original languageEnglish (US)
    Pages (from-to)710-721
    Number of pages12
    JournalProceedings of the VLDB Endowment
    Volume1
    Issue number1
    DOIs
    StatePublished - Jan 1 2008

    Fingerprint

    Heuristic methods
    Processing
    Experiments

    ASJC Scopus subject areas

    • Computer Science (miscellaneous)
    • Computer Science(all)

    Cite this

    Yahia, S. A., Benedikt, M., Lakshmanan, L. V. S., & Stoyanovich, J. (2008). Efficient network aware search in collaborative tagging sites. Proceedings of the VLDB Endowment, 1(1), 710-721. https://doi.org/10.14778/1453856.1453934

    Efficient network aware search in collaborative tagging sites. / Yahia, Sihem Amer; Benedikt, Michael; Lakshmanan, Laks V.S.; Stoyanovich, Julia.

    In: Proceedings of the VLDB Endowment, Vol. 1, No. 1, 01.01.2008, p. 710-721.

    Research output: Contribution to journalArticle

    Yahia, SA, Benedikt, M, Lakshmanan, LVS & Stoyanovich, J 2008, 'Efficient network aware search in collaborative tagging sites', Proceedings of the VLDB Endowment, vol. 1, no. 1, pp. 710-721. https://doi.org/10.14778/1453856.1453934
    Yahia, Sihem Amer ; Benedikt, Michael ; Lakshmanan, Laks V.S. ; Stoyanovich, Julia. / Efficient network aware search in collaborative tagging sites. In: Proceedings of the VLDB Endowment. 2008 ; Vol. 1, No. 1. pp. 710-721.
    @article{e5a2db8536c342039be0674fe1c2ab9b,
    title = "Efficient network aware search in collaborative tagging sites",
    abstract = "The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network of taggers related to a seeker. In this paper, we present the first in-depth study of network-aware search. We investigate efficient top-k processing when the score of an answer is computed as its popularity among members of a seeker's network. We argue that obvious adaptations of top-k algorithms are too space-intensive, due to the dependence of scores on the seeker's network. We therefore develop algorithms based on maintaining score upper-bounds. The global upper-bound approach maintains a single score upper-bound for every pair of item and tag, over the entire collection of users. The resulting bounds are very coarse. We thus investigate clustering seekers based on similar behavior of their networks. We show that finding the optimal clustering of seekers is intractable, but we provide heuristic methods that give substantial time improvements. We then give an optimization that can benefit smaller populations of seekers based on clustering of taggers. Our results are supported by extensive experiments on del.icio.us datasets.",
    author = "Yahia, {Sihem Amer} and Michael Benedikt and Lakshmanan, {Laks V.S.} and Julia Stoyanovich",
    year = "2008",
    month = "1",
    day = "1",
    doi = "10.14778/1453856.1453934",
    language = "English (US)",
    volume = "1",
    pages = "710--721",
    journal = "Proceedings of the VLDB Endowment",
    issn = "2150-8097",
    publisher = "Very Large Data Base Endowment Inc.",
    number = "1",

    }

    TY - JOUR

    T1 - Efficient network aware search in collaborative tagging sites

    AU - Yahia, Sihem Amer

    AU - Benedikt, Michael

    AU - Lakshmanan, Laks V.S.

    AU - Stoyanovich, Julia

    PY - 2008/1/1

    Y1 - 2008/1/1

    N2 - The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network of taggers related to a seeker. In this paper, we present the first in-depth study of network-aware search. We investigate efficient top-k processing when the score of an answer is computed as its popularity among members of a seeker's network. We argue that obvious adaptations of top-k algorithms are too space-intensive, due to the dependence of scores on the seeker's network. We therefore develop algorithms based on maintaining score upper-bounds. The global upper-bound approach maintains a single score upper-bound for every pair of item and tag, over the entire collection of users. The resulting bounds are very coarse. We thus investigate clustering seekers based on similar behavior of their networks. We show that finding the optimal clustering of seekers is intractable, but we provide heuristic methods that give substantial time improvements. We then give an optimization that can benefit smaller populations of seekers based on clustering of taggers. Our results are supported by extensive experiments on del.icio.us datasets.

    AB - The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network of taggers related to a seeker. In this paper, we present the first in-depth study of network-aware search. We investigate efficient top-k processing when the score of an answer is computed as its popularity among members of a seeker's network. We argue that obvious adaptations of top-k algorithms are too space-intensive, due to the dependence of scores on the seeker's network. We therefore develop algorithms based on maintaining score upper-bounds. The global upper-bound approach maintains a single score upper-bound for every pair of item and tag, over the entire collection of users. The resulting bounds are very coarse. We thus investigate clustering seekers based on similar behavior of their networks. We show that finding the optimal clustering of seekers is intractable, but we provide heuristic methods that give substantial time improvements. We then give an optimization that can benefit smaller populations of seekers based on clustering of taggers. Our results are supported by extensive experiments on del.icio.us datasets.

    UR - http://www.scopus.com/inward/record.url?scp=84859178171&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84859178171&partnerID=8YFLogxK

    U2 - 10.14778/1453856.1453934

    DO - 10.14778/1453856.1453934

    M3 - Article

    AN - SCOPUS:84859178171

    VL - 1

    SP - 710

    EP - 721

    JO - Proceedings of the VLDB Endowment

    JF - Proceedings of the VLDB Endowment

    SN - 2150-8097

    IS - 1

    ER -