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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carmel, D., Roitman, H., Yom-Tov, E.: Social bookmark weighting for search and recommendation. The VLDB Journal 19, 761–775 (2010)
Dang, V., Kumaran, G., Troy, A.: Domain dependent query reformulation for web search. In: The ACM International Conference on Information and Knowledge Management, CIKM (2012)
Han, J., Pei, J., Yin, Y.: Mining frequent pattern without candidate generation. In: The ACM International Conference on Management of Data, SIGMOD (2010)
Kato, M.P., Sakai, T., Tanaka, K.: Structured query suggestion for specialization and parallel movement: Effect on search behaviors. In: The 21st International Conference on World Wide Web, WWW (2012)
Kong, W., Allan, J.: Extracting query facets from search results. In: The International Conference on Research and Development in Information Retrieval, SIGIR (2013)
Li, C., Yan, N., Roy, S.B., Lisham, L., Das, G.: Facetedpedia: Dynamic generation of query-dependent faceted interfaces for wikipedia. In: The 19th International Conference on World Wide Web (WWW), pp. 651–660 (2010)
Liang, X., Xie, M., Lakshmanan, L.V.S.: Adding structure to top-k: From items to expansions. In: The 20th International Conference on Information and Knowledge Management, CIKM (2011)
Ozertem, U., Chapelle, O., Donmez, P., Velipasaoglu, E.: Learning to suggest: A machine learning framework for ranking query suggestions. In: The ACM International Conference on Research and Development in Information Retrieval, SIGIR (2012)
Skoutas, D., Alrifai, M.: Tag clouds revisited. In: The 20th ACM International Conference on Information and Knowledge Management, ACM CIKM (2011)
Vandic, D., van Dam, J.-W., Hogenboom, F.: A semantic clustering-based approach for searching and browsing tag spaces. In: The 26th ACM Symposium on Applied Computing, SAC (2011)
Venetis, P., Koutrika, G., Garcia-Molina, H.: On the selection of tags for tag clouds. In: The ACM International Conference on Web Search and Data Mining, WSDM (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Koh, JL., Chiu, IC. (2014). An Efficient Approach for Mining Top-k High Utility Specialized Query Expansions on Social Tagging Systems. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds) Database Systems for Advanced Applications. DASFAA 2014. Lecture Notes in Computer Science, vol 8422. Springer, Cham. https://doi.org/10.1007/978-3-319-05813-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-05813-9_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05812-2
Online ISBN: 978-3-319-05813-9
eBook Packages: Computer ScienceComputer Science (R0)