Andere Kunden interessierten sich auch für
![Enhancing the collection of treatment outcomes data through CaNISC]( "Enhancing the collection of treatment outcomes data through CaNISC")
Enhancing the collection of treatment outcomes data through CaNISC35,99 €![Collection and classification of Services and their context]( "Collection and classification of Services and their context")
Collection and classification of Services and their context44,99 €![Feature Location in a Collection of Software Product Variants]( "Feature Location in a Collection of Software Product Variants")
Feature Location in a Collection of Software Product Variants44,99 €![Path Queries and Data Collection in Geometric Networks]( "Path Queries and Data Collection in Geometric Networks")
Path Queries and Data Collection in Geometric Networks39,99 €![Advanced Automation Technology of Electronics Tax and Vat Collection]( "Advanced Automation Technology of Electronics Tax and Vat Collection")
Advanced Automation Technology of Electronics Tax and Vat Collection26,99 €![Mathematical Tools for Data Mining]( "Mathematical Tools for Data Mining")
Mathematical Tools for Data Mining122,99 €![Trends in Practical Applications of Scalable Multi-Agent Systems, the PAAMS Collection]( "Trends in Practical Applications of Scalable Multi-Agent Systems, the PAAMS Collection")
Trends in Practical Applications of Scalable Multi-Agent Systems, the PAAMS Collection110,99 €
The focus of this research is collection selection for distributed information retrieval. The collection descriptions that are necessary for selecting the most relevant collections are often created from information gathered by random sampling. Collection selection based on an incomplete index constructed by using random sampling instead of a full index leads to inferior results. We propose to use collection clustering to compensate for the incompleteness of the indexes. When collection clustering is used we do not only select the collections that are considered relevant based on their collection descriptions, but also collections that have similar content in their indexes. We describe a new clustering algorithm that allows us to specify the sizes of the produced clusters instead of the number of clusters. Our experiments show that that collection clustering can indeed improve the performance of distributed information retrieval systems that use random sampling. There is not muchdifference in retrieval performance between our clustering algorithm and the well-known k-means algorithm. We suggest to use the algorithm we proposed because it is more scalable.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.