Beyond basic faceted search

Ben-Yitzhak, Ori; Golbandi, Nadav; Har'El, Nadav; Lempel, Ronny; Neumann, Andreas; Ofek-Koifman, Shila; Sheinwald, Dafna; Shekita, Eugene J.; Sznajder, Benjamin; Yogev, Sivan

doi:10.1145/1341531.1341539

Cited by 110 publications

(91 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…O. Ben-Yitzhak, N. Golbandi, N. Har'El, R. Lempel, A. Neumann, S. Ofek-Koifman, D. Sheinwald, E. Shekita, B. Sznajder, and S. Yogev proposes a method [3] that is beyond basic faceted search. Interaction with complex and high-dimensional data is often involved in transactions.…”

Section: Literature Reviewmentioning

confidence: 99%

A Survey on Mining Aspects for Queries

Padmanabhan¹,

D²

2017

International Journal of Advanced Research in Computer and Comm

View full text Add to dashboard Cite

Abstract:There is a problem of finding query facets or angles that is a particular aspect or feature of something which are multiple groups of words or phrases that explain and summarize th content covered by a query. Query facets provide interesting and useful knowledge about a query and thus can be used to improve search experiences in many ways. First, we can display query facets together with the original search results in an appropriate way. Second, query facets may provide direct information or instant answers that users are seeking. Third, query facets may also be used to improve the diversity of the ten blue links. It is an assumption that the important aspects of a query are usually presented and repeated in the query's top retrieved documents in the style of lists, and query facets can be mined out by aggregating these significant lists. This can be solved by automatically mine query facets by extracting and grouping frequent lists from free text, HTML tags, and repeat regions within top search results. Then a large number of lists do exist and useful query angles can be mined.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Survey on Mining Aspects for Queries

Padmanabhan¹,

D²

2017

International Journal of Advanced Research in Computer and Comm

View full text Add to dashboard Cite

show abstract

“…Works like [23] describe efficient approaches to enable this navigation. However, all these approaches are based on the assumption of pre-established and immutable schemata.…”

Section: Related Workmentioning

confidence: 99%

Learning object repositories with dynamically reconfigurable metadata schemata

Gayoso-Cabada

Rodríguez-Cerezo

Sierra

2016

2016 International Symposium on Computers in Education (SIIE)

View full text Add to dashboard Cite

Abstract-In this paper we describe a model of learning object repository in which users have full control on the metadata schemata. Thus, they can define new schemata and they can reconfigure existing ones in a collaborative fashion. As consequence, the repository must react to changes in schemata in a dynamic and responsive way. Since schemata enable operations like navigation and search, dynamic reconfigurability requires clever indexing strategies, resilient to changes in these schemata. For this purpose, we have used conventional inverted indexing approaches and we have also devised a hierarchical clusteringbased indexing model. By using Clavy, a system for managing learning object repositories in the field of the Humanities, we provide some experimental results that show how the hierarchical clustering-based model can outperform the more conventional inverted indexes-based solutions.

show abstract

“…Finally, our work presents some similarities with faceted search (e.g., [4,16]). Faceted search is an exploration technique that provides a form of navigational search.…”

Section: Related Workmentioning

confidence: 99%

A Framework for Grouping and Summarizing Keyword Search Results

Gkorgkas

Stefanidis

Nørvåg

2013

Advances in Databases and Information Systems

View full text Add to dashboard Cite

Abstract. With the rapid growth of the Web, keyword-based searches become extremely ambiguous. To guide users to identify the results of their interest, in this paper, we consider an alternative way for presenting the results of a keyword search. In particular, we propose a framework for organizing the results into groups that contain results with similar content and refer to similar temporal characteristics. Moreover, we provide summaries of results as hints for query refinement. A summary of a result set is expressed as a set of popular keywords in the result set. Finally, we report evaluation results of the effectiveness of our approach.

show abstract

Beyond basic faceted search

Cited by 110 publications

References 15 publications

A Survey on Mining Aspects for Queries

A Survey on Mining Aspects for Queries

Learning object repositories with dynamically reconfigurable metadata schemata

A Framework for Grouping and Summarizing Keyword Search Results

Contact Info

Product

Resources

About