{"title":"利用查询面进行搜索结果导航","authors":"Jan Friedrich, C. Lindemann, Michael Petrifke","doi":"10.1109/DEXA.2015.66","DOIUrl":null,"url":null,"abstract":"Facets provide an efficient way to analyze and navigate the search result space. However, we believe facet selection has been guided by suboptimal facet and facet term properties. In this paper, we present features that rank facets based on their utility to partition the search result documents. Moreover, we propose a computationally inexpensive facet generation algorithm, provide a novel approach to extract term lists from HTML documents, and analyze facet feedback models using BM25F as baseline retrieval model. We show that the proposed approach outperforms existing algorithms and discuss the significantly reduced computational costs.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"204 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Utilizing Query Facets for Search Result Navigation\",\"authors\":\"Jan Friedrich, C. Lindemann, Michael Petrifke\",\"doi\":\"10.1109/DEXA.2015.66\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Facets provide an efficient way to analyze and navigate the search result space. However, we believe facet selection has been guided by suboptimal facet and facet term properties. In this paper, we present features that rank facets based on their utility to partition the search result documents. Moreover, we propose a computationally inexpensive facet generation algorithm, provide a novel approach to extract term lists from HTML documents, and analyze facet feedback models using BM25F as baseline retrieval model. We show that the proposed approach outperforms existing algorithms and discuss the significantly reduced computational costs.\",\"PeriodicalId\":239815,\"journal\":{\"name\":\"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)\",\"volume\":\"204 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DEXA.2015.66\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEXA.2015.66","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Utilizing Query Facets for Search Result Navigation
Facets provide an efficient way to analyze and navigate the search result space. However, we believe facet selection has been guided by suboptimal facet and facet term properties. In this paper, we present features that rank facets based on their utility to partition the search result documents. Moreover, we propose a computationally inexpensive facet generation algorithm, provide a novel approach to extract term lists from HTML documents, and analyze facet feedback models using BM25F as baseline retrieval model. We show that the proposed approach outperforms existing algorithms and discuss the significantly reduced computational costs.