| James C. French, Alison L. Powell, Jamie Callan, Charles L. Viles, Travis Emmitt, Kevin J. Prey, and Yun Mou. Comparing the performance of database selection algorithms. In Proc. ACM SIGIR 1999. |
....searching distributed heterogeneous repositories. Researchers have focused on identifying architectures [15, 2, 9] and models [25, 34, 5] that can search hundreds of repositories. For this, work has been done on identifying a common resource description language [26] repository selection schemes [13] and merging of ranked lists returned [33] Heterogeneity in search interfaces has led implementors to converge on mediator [3, 1, 20] based architecture with wrappers for each participant repository that rewrite the query and interpret the ranked lists returned. P2P networks are distributed. ....
....each topic centroid is computed. The similarity scores are used to rank the C segments in descending order with ties broken arbitrarily. The top R C segments are then deemed relevant, where R is a tunable parameter. The similarity function used has immense bearing on recall. The CORI algorithm [13, 5] has been shown to perform well, but requires global information and high maintenance trac when documents have been clustered [30] We experimented with the simpler cosine distance function which needs minimal information for computation. A query message consisting of the query vector and the ....
[Article contains additional citation context not shown here]
J. French, A. Powell, J. Callan, C. Viles, T. Emmitt, K. Prey, and Y. Mou. Comparing the performance of database selection algorithms. In Proc. of the 22nd ACM Conf. on Information Retrieval (SIGIR), 1999.
....assuming that we want submit an information retrieval query to a subset of the databases available only, decide which databases are more likely to contain the most relevant documents. A number of algorithms have been proposed and experimental results show that these algorithms achieve good results [3, 9, 11, 23, 22]. Recent work [14, 17] shows that good performance can be achieved in this setting, if the collections are conceptually separated. However, these algorithms assume that the querying party has some statistical knowledge about the contents of each database (for example, word frequencies in ....
J. C. French, A. L. Powell, J. Callan, C. L. Viles, T. Emmitt, K. J. Prey, and Y. Mou. Comparing the Performance of Database Selection Algorithms. Proc. of ACM SIGIR Research and Development in Information Retrieval, 1999.
....libraries instead of documents. Thus, term frequencies are replaced by document frequencies, and document frequencies by collection frequencies. CORI also covers the data fusion problem, where the library score is used to normalise the document score. Experiments showed that CORI outperforms GlOSS [8]. Using phrases and query expansion improve overall retrieval quality[25] Xu and Croft apply language models to the resource selection task [26] Here, libraries are ranked according to the KullbackLeibler distance between the library language model and the query language model. The performance ....
J. French, A. Powell, J. Callan, C. Viles, T. Emmitt, K. Prey, and Y. Mou. Comparing the performance of database selection algorithms. In SIGIR:99 [19], pages 238--245.
No context found.
FRENCH,J.C.,POWELL, A. L., CALLAN, J., VILES, C. L., EMMITT, T., PREY,K.J.,AND MOU, Y. 1999. Comparing the performance of database selection algorithms. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, New York.
No context found.
J.C. French, A.L. Powell, J. Callan, C.L. Viles, T. Emmitt, K.J. Prey, and Y. Mou. "Comparing the performance of database selection algorithms." In Proc. of the 22 nd Annual Int'l ACM SIGIR Conference on Research and Development in Information Retrieval, 1999.
No context found.
J.C. French, A.L. Powell, J. Callan, C.L. Viles, T. Emmitt, K.J. Prey, and Y. Mou. (1999). Comparing the performance of database selection algorithms. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.
No context found.
French, J.C., Powell, A.L., Callan, J., Viles, C.L., Emmitt, T., Prey, K.J., Mou, Y.: Comparing the performance of database selection algorithms. In Proceedings of the Twenty Second Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1999)
No context found.
French, J.C., Powell, A.L., Callan, J., Viles, C.L., Emmitt, T., Prey, K.J., Mou, Y.: Comparing the performance of database selection algorithms. In Proceedings of the Twenty Second Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1999)
No context found.
FRENCH,J.C.,POWELL, A. L., CALLAN, J., VILES, C. L., EMMITT, T., PREY,K.J.,AND MOU, Y. 1999. Comparing the performance of database selection algorithms. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, New York.
No context found.
French, J.C., Powell, A.L., Callan, J., Viles, C.L., Emmitt, T., Prey, K.J., Mou, Y.: Comparing the performance of database selection algorithms. In Proceedings of the Twenty Second Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1999)
No context found.
J.C. French, A.L. Powell, J. Callan, C.L. Viles, T. Emmitt, K.J. Prey, and Y. Mou. Comparing the performance of database selection algorithms. In Proc. of the 22nd Annual Int'l ACM SIGIR Conference on Research and Development in Information Retrieval, 1999.
No context found.
J.C. French, A.L. Powell, J. Callan, C.L. Viles, T. Emmitt, K.J. Prey, and Y. Mou. (1999). Comparing the performance of database selection algorithms. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.
....be presented to a user. Anumber of different approaches for collection selection using free text queries have been proposed and individually evaluated [3, 15, 22, 24, 30, 35, 36] Three of these approaches, CORI [3] CVV [36] and gGlOSS[22] were evaluated in a common environment by French, et al.[2, 12, 14], who found that there was significant room for improvement in all approaches, especially when very few databases were selected. One of the goals of these experiments is to determine if the use of augmented queries can provide that improvement. Other work has shown that improvements in collection ....
....document retrieval. 6.3 Collection Selection Methodology 6.3.1 CORI Weusedtwo collection selection approaches in our experiments. First, we used the existing CORI [3] collection selection approach. CORI has been shown to perform well for collection selection when compared to other approaches [2, 12]. CORI makes use of document frequency information about terms in collections to rank collections for selection. Because collection selection experiments were performed independently of document retrieval, we implemented the published CORI algorithm [3] 19 The standard distribution of CORI ....
[Article contains additional citation context not shown here]
J. C. French, A. L. Powell, J. Callan, C. L. Viles, T. Emmitt, K. J. Prey, and Y. Mou. Comparing the Performance of Database Selection Algorithms. In Proc. ACM SIGIR '99, pages 238--245, 1999.
....models each document database as a very large document, and ranks each database using a modified version of a well known document ranking algorithm. Previous research has demonstrated that the CORI algorithm is one of the most effective and robust resource selection algorithms developed so far [1, 4], but the previous research was confined to environments in which database sizes did not vary widely. In some real world environments, such as the U.S. government, allowing digital libraries to be created and maintained independently results in a distribution of database sizes that varies over a ....
.... databases containing up to 1,000,000 documents [3] A variety of resource selection algorithms have been investigated in prior research [5, 3, 1] The CORI resource selection algorithm has been shown by different researchers to be one of the most stable and effective resource selection algorithms [1, 4], so it was used as a baseline in the research reported here. The CORI algorithm operates on resource descriptions that consist of vocabulary, term frequency, and corpus statistics for each document database. It is based on a Bayesian Inference Network model of information retrieval in which each ....
[Article contains additional citation context not shown here]
J.C. French, A.L. Powell, J. Callan, C.L. Viles, T. Emmitt, K.J. Prey, and Y. Mou. "Comparing the performance of database selection algorithms." In Proc. of the 22 nd Annual Int'l ACM SIGIR Conference on Research and Development in Information Retrieval, 1999.
No context found.
James C. French, Alison L. Powell, Jamie Callan, Charles L. Viles, Travis Emmitt, Kevin J. Prey, and Yun Mou. Comparing the performance of database selection algorithms. In Proc. ACM SIGIR 1999.
No context found.
J. C. French, A. L. Powell, J. P. Callan, C. L. Viles, T. Emmitt, K. J. Prey, and Y. Mou. Comparing the performance of database selection algorithms. In Research and Development in Information Retrieval, pages 238--245, 1999.
No context found.
J. French, Allison, Powell, etc. "Comparing the performance of database selection algorithms." Proceedings of the SIGIR'99 Conference, 1999.
No context found.
J.C. French, A.L. Powell, J.P. Callan, C.L. Viles, T. Emmitt, K.J. Prey, and Y. Mou, "Comparing the Performance of Database Selection Algorithms," Research and Development in Information Retrieval, pp. 238-245, 1999.
No context found.
J. C. French, A. L. Powell, J. P. Callan, C. L. Viles, T. Emmitt, K. J. Prey, and Y. Mou. Comparing the performance of database selection algorithms. In SIGIR'99, 1999.
No context found.
French J.C., Powell A.L., Callan J., Viles C.L., Emmitt T., Prey K.J., and Mou Y. "Comparing the Performance of Database Selection Algorithms". Proc. of ACM SIGIR Research and Development in Information Retrieval, 1999.
No context found.
J. French, A. Powell, J. Callan, C. Viles, T. Emmitt, K. Prey, and Y.Mou. Comparing the performance of database selection algorithms. In Proceedings of the 22nd Annual InterProceedings of the 11 th IEEE International Symposium on High Performance Distributed Computing HPDC-11 2002.
No context found.
J. C. French, A. L. Powell, J. Callan, C. L. Viles, T. Emmitt, K. J. Prey, and Y. Mou, "Comparing the Performance of Database Selection Algorithms". Proc. of ACM SIGIR'99, Berkeley, CA, 1999.
No context found.
J. French, Allison, Powell, etc. "Comparing the performance of database selection algorithms". In Proceedings of the SIGIR'99 Conference, 1999.
No context found.
J. French, A. Powell, J. Callan, C. Viles, T. Emmitt, K. Prey, and Y. Mou. Comparing the performance of database selection algorithms. In Proc. 22nd ACM Conf. on Information Retrieval (SIGIR), pages 238--245, 1999.
No context found.
J. French, A. Powell, J. Callan, C. Viles, T. Emmitt, K. Prey, and Y.Mou. Comparing the performance of database selection algorithms. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 238--245, 1999.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC