Author : B.Prasanna Kumar 1
Date of Publication :7th December 2017
Abstract: A web search for queries is repeatedly ambiguous or versatile, which makes an easy ranked list of outcomes unsatisfactory. The Web has been widely used for getting different kinds of information in recent times. An important feature of the query is presented and repeated in the top retrieved documents in the style of lists. Query facets can be extracted by collecting these significant lists. Query facets may give direct information or immediate answers that users are looking for i.e., a user can choose a particular facet item which he found significant to his search need. So, the list of format style is much more user-friendly than displaying searches sentence wise. The scope of QDMiner system is limited to get search results of a query in list format i.e., facets. For this problem of finding query facets, a Systematic solution. QDMiner is proposed in which query facets are extracted from top search results of a query. Facets are mined out by extracting and grouping frequent lists from HTML tags, repeat regions, free text within top search results of a query. Previously, there has been a lot of work done for retrieving more relevant data to users in order to meet their information needs thus improving Performance of Search engines. It can afford the stage for users to describe their Information needed and more clearly using query facets mining. To extract information in the form of facets, a QDMiner system is proposed. The search result on QDMiner facets is used for better performance
Reference :
-
- O. Ben-Yitzhak, N. Golbandi, N. Har’El, R. Lempel, A. Neumann,S. Ofek-Koifman, D. Sheinwald, E. Shekita, B. Sznajder, and S. Yogev, “Beyond basic faceted search,” in Proc. Int. Conf. Web Search Data Mining, 2008, pp. 33–4
- M. Diao, S. Mukherjea, N. Rajput, and K. Srivastava,, “Faceted search and browsing of audio content on spoken web,” in Proc. 19th ACM Int. Conf. Inf. Knows. Manage., 2010, pp. 1029–1038.
- D. Dash, J. Rao, N. Megiddo, A. Ailamaki, and G. Lohman, “Dynamic faceted search for discovery-driven analysis,” in ACM Int. Conf. Inf. Knows. Manage.,pp.3– 12,2008.
- W. Kong and J. Allan, “Extending faceted search to the general web,” in Proc. ACM Int. Conf. Inf. Knows. Manage., 2014, pp. 839–848.
- T. Cheng, X. Yan, and K. C.-C. Chang, “Supporting entity search: A large-scale prototype search engine,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2007, pp. 1144–1146.
- K. Balog, E. Meij, and M. de Rijke, “Entity search: Building bridges between two worlds,” in Proc. 3rd Int. Semantic Search Workshop, 2010, pp. 9:1–9:5
- M. Bron, K. Balog, and M. de Rijke, “Ranking related entities: Components and analyses,” in Proc. ACM Int. Conf. Inf. Known. Manage., 2010, pp. 1079–1088
- C. Li, N. Yan, S. B. Roy, L. Lisham, and G. Das, “Facetedpedia: Dynamic generation of query-dependent faceted interfaces for wikipedia,” in Proc. 19th Int. Conf. World Wide Web, 2010, pp. 651–660.
- W. Dakka and P. G. Ipeirotis, “Automatic extraction of useful facet hierarchies from text databases,” in Proc. IEEE 24th Int. Conf. Data Eng., 2008, pp. 466–475.
- A. Herdagdelen, M. Ciaramita, D. Mahler, M. Holmqvist, K. Hall, S. Riezler, and E. Alfonseca, “Generalized syntactic and semantic models of query reformulation,” in Proc. 33rd Int. ACM SIGIR Conf. Res. Develop. Inf. retrieval, 2010, pp. 283–290.