An efficient approach for mining Top-k high utility specialized query expansions on social tagging systems

Jia Ling Koh, I. Chih Chiu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A specialized query expansion consists of a set of keywords, which is used to reduce the size of search results in order to help users find the required data conveniently. The utility of a specialized query expansion represents the qualities of the top-N high quality objects matching the expansion. Given the search results of a keyword query on social tagging systems, we want to find k specialized query expansions with the highest utilities without redundancy. Besides, the discovered expansions are guaranteed to match at least N objects. We construct a tree structure, called an UT-tree, to maintain the tag sets appearing in the search results for generating the specialized query expansions. We first propose a depth-first approach to find the top-k high utility specialized query expansions from the UT-tree. For further speeding up this basic approach, we exploit the lower bound and upper bound estimations of utilities for a specialized query expansion to reduce the size of the constructed UT-tree. Only the tag sets of objects which are possibly decide the top-k high utility specialized query expansions need to be accessed and maintained. By applying this strategy, we propose another faster algorithm. The experiment results demonstrate that the proposed algorithms work well on both the effectiveness and the efficiency.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 19th International Conference, DASFAA 2014, Proceedings
PublisherSpringer Verlag
Pages361-376
Number of pages16
EditionPART 2
ISBN (Print)9783319058122
DOIs
Publication statusPublished - 2014 Jan 1
Event19th International Conference on Database Systems for Advanced Applications, DASFAA 2014 - Bali, Indonesia
Duration: 2014 Apr 212014 Apr 24

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume8422 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Conference on Database Systems for Advanced Applications, DASFAA 2014
CountryIndonesia
CityBali
Period14/4/2114/4/24

Fingerprint

Query Expansion
Tagging
Mining
Tree Structure
Fast Algorithm
Redundancy
Query
Lower bound
Upper bound
Demonstrate
Experiment

Keywords

  • Specialized query expansion
  • social tagging system

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Koh, J. L., & Chiu, I. C. (2014). An efficient approach for mining Top-k high utility specialized query expansions on social tagging systems. In Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, Proceedings (PART 2 ed., pp. 361-376). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8422 LNCS, No. PART 2). Springer Verlag. https://doi.org/10.1007/978-3-319-05813-9_24

An efficient approach for mining Top-k high utility specialized query expansions on social tagging systems. / Koh, Jia Ling; Chiu, I. Chih.

Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, Proceedings. PART 2. ed. Springer Verlag, 2014. p. 361-376 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8422 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Koh, JL & Chiu, IC 2014, An efficient approach for mining Top-k high utility specialized query expansions on social tagging systems. in Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 8422 LNCS, Springer Verlag, pp. 361-376, 19th International Conference on Database Systems for Advanced Applications, DASFAA 2014, Bali, Indonesia, 14/4/21. https://doi.org/10.1007/978-3-319-05813-9_24
Koh JL, Chiu IC. An efficient approach for mining Top-k high utility specialized query expansions on social tagging systems. In Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, Proceedings. PART 2 ed. Springer Verlag. 2014. p. 361-376. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-319-05813-9_24
Koh, Jia Ling ; Chiu, I. Chih. / An efficient approach for mining Top-k high utility specialized query expansions on social tagging systems. Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, Proceedings. PART 2. ed. Springer Verlag, 2014. pp. 361-376 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{f4df01ca4861415f99cbc2239fdef454,
title = "An efficient approach for mining Top-k high utility specialized query expansions on social tagging systems",
abstract = "A specialized query expansion consists of a set of keywords, which is used to reduce the size of search results in order to help users find the required data conveniently. The utility of a specialized query expansion represents the qualities of the top-N high quality objects matching the expansion. Given the search results of a keyword query on social tagging systems, we want to find k specialized query expansions with the highest utilities without redundancy. Besides, the discovered expansions are guaranteed to match at least N objects. We construct a tree structure, called an UT-tree, to maintain the tag sets appearing in the search results for generating the specialized query expansions. We first propose a depth-first approach to find the top-k high utility specialized query expansions from the UT-tree. For further speeding up this basic approach, we exploit the lower bound and upper bound estimations of utilities for a specialized query expansion to reduce the size of the constructed UT-tree. Only the tag sets of objects which are possibly decide the top-k high utility specialized query expansions need to be accessed and maintained. By applying this strategy, we propose another faster algorithm. The experiment results demonstrate that the proposed algorithms work well on both the effectiveness and the efficiency.",
keywords = "Specialized query expansion, social tagging system",
author = "Koh, {Jia Ling} and Chiu, {I. Chih}",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-05813-9_24",
language = "English",
isbn = "9783319058122",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
number = "PART 2",
pages = "361--376",
booktitle = "Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, Proceedings",
edition = "PART 2",

}

TY - GEN

T1 - An efficient approach for mining Top-k high utility specialized query expansions on social tagging systems

AU - Koh, Jia Ling

AU - Chiu, I. Chih

PY - 2014/1/1

Y1 - 2014/1/1

N2 - A specialized query expansion consists of a set of keywords, which is used to reduce the size of search results in order to help users find the required data conveniently. The utility of a specialized query expansion represents the qualities of the top-N high quality objects matching the expansion. Given the search results of a keyword query on social tagging systems, we want to find k specialized query expansions with the highest utilities without redundancy. Besides, the discovered expansions are guaranteed to match at least N objects. We construct a tree structure, called an UT-tree, to maintain the tag sets appearing in the search results for generating the specialized query expansions. We first propose a depth-first approach to find the top-k high utility specialized query expansions from the UT-tree. For further speeding up this basic approach, we exploit the lower bound and upper bound estimations of utilities for a specialized query expansion to reduce the size of the constructed UT-tree. Only the tag sets of objects which are possibly decide the top-k high utility specialized query expansions need to be accessed and maintained. By applying this strategy, we propose another faster algorithm. The experiment results demonstrate that the proposed algorithms work well on both the effectiveness and the efficiency.

AB - A specialized query expansion consists of a set of keywords, which is used to reduce the size of search results in order to help users find the required data conveniently. The utility of a specialized query expansion represents the qualities of the top-N high quality objects matching the expansion. Given the search results of a keyword query on social tagging systems, we want to find k specialized query expansions with the highest utilities without redundancy. Besides, the discovered expansions are guaranteed to match at least N objects. We construct a tree structure, called an UT-tree, to maintain the tag sets appearing in the search results for generating the specialized query expansions. We first propose a depth-first approach to find the top-k high utility specialized query expansions from the UT-tree. For further speeding up this basic approach, we exploit the lower bound and upper bound estimations of utilities for a specialized query expansion to reduce the size of the constructed UT-tree. Only the tag sets of objects which are possibly decide the top-k high utility specialized query expansions need to be accessed and maintained. By applying this strategy, we propose another faster algorithm. The experiment results demonstrate that the proposed algorithms work well on both the effectiveness and the efficiency.

KW - Specialized query expansion

KW - social tagging system

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

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

U2 - 10.1007/978-3-319-05813-9_24

DO - 10.1007/978-3-319-05813-9_24

M3 - Conference contribution

AN - SCOPUS:84958533559

SN - 9783319058122

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 361

EP - 376

BT - Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, Proceedings

PB - Springer Verlag

ER -