نتایج جستجو برای: cluster expansion
تعداد نتایج: 339939 فیلتر نتایج به سال:
In 1983, Felderhof, Ford, and Cohen gave microscopic explanation of the famous Clausius-Mossotti formula for the dielectric constant of nonpolar dielectric. They based their considerations on the cluster expansion of the dielectric constant, which relates this macroscopic property with the microscopic characteristics of the system. In this article, we analyze the cluster expansion of Felderhof,...
In this paper, we present a new approach for automatic thesaurus construction and query expansion for document retrieval. We analyze the information between any two terms in each document cluster center of final document clusters or intermediate document clusters in the clustering process to automatically construct the thesaurus, where these information includes the co-occurrence frequency of a...
We use a retrieval system with search result clustering to tackle the NTCIR-5 WEB Query Term Expansion Subtask. The system clusters the search results in such a way as to make it easier for the user to select relevant documents as feedback documents. In addition, we select phrase words or named entities(NE) as query-expansion keywords from the feedback documents because these words tend to repr...
The total recall track in TREC 2015 seeks an enhanced model to accelerate the autonomous technology-assisted review process. This paper introduces several noval ideas such as clustering based seed selection method, extended n-grams features and continuous query expansion learned from the relevant documents derived from each iteration. These methods can retrieve more relevant documents from each...
The PolyUCOMP team participated in two TAC-KBP2011 tasks: Regular Entity Linking and Regular Slot Filling. For the entity linking task, a three-step entity linking system is developed. Similar to some systems in KBP 2010, a list of possible candidates are first selected. Then the best candidate is identified to decide whether a link exists. In addition, a document clustering algorithm is used t...
This paper overviews BUPTTeam’s participation in the Entity Linking task at TAC 2012. In this paper we propose a method to link the queries and KB entries based on four steps: 1) query expansion, 2) candidates generation, 3) candidates ranking, 4) clustering. In the initial stage, we expand the queries from the background documents using the defined rules. We generate in the knowledge base acco...
There are many algorithms for dividing a graph into parts, so-called clusters. An essential question is how dense these clusters are. This can be measured by the intra-cluster expansion. The cut-clustering algorithm as presented by Flake et al. [FTT04] provides a theoretical guarantee on the intra-cluster expansion, which for example greedy clustering approaches can not give, as calculating the...
The Clairvoyance team participated in the HARD Track, submitting fifteen runs. Our experiments focused primarily on exploiting user feedback through clarification forms for query expansion. We made limited use of the genre and related text metadata. Within the clarification form feedback framework, we explored the cluster hypothesis in the context of relevance feedback. The cluster hypothesis s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید