Norbert Fuhr
About the author:
No description available of Norbert Fuhr...
Publications by Norbert Fuhr (bibliography)
» 2007 «
Ernst-Gerlach, Andrea and Fuhr, Norbert (2007): Retrieval in text collections with historic spelling using linguistic and spelling variants. In: JCDL07: Proceedings of the 7th ACM/IEEE-CS Joint Conference on Digital Libraries 2007. pp. 333-341. Available online
“We present a new approach for the retrieval of texts with non-standard spelling, which is important for historic texts e.g. in English or German. In this paper, we describe the overall architecture of our system, followed by its evaluation. Given a search term as lemma, we use a dictionary of contemporary German for finding all inflected and derived forms of the lemma. Then we apply transformation rules (derived from training data) for generating historic spelling variants. For the evaluation, we regard the resulting retrieval quality. The experimental results show that we can improve the retrieval quality for historic collections substantially.”
Copyrights may apply
Agosti, Maristella, Beretti, Stefano, Brettlecker, Gert, Bimbo, Alberto Del, Ferro, Nicola, Fuhr, Norbert, Keim, Daniel, Klas, Claus-Peter, Lidy, Thomas, Norrie, Moira C., Ranaldi, Paola and Schek, Hans-Jörg (2007): DelosDLMS - the Integrated DELOS Digital Library Management System. In: DELOS Conference on Digital Libraries February 2007, 2007, Pisa, Italy. .
“DelosDLMS is a prototype of a next-generation Digital Library (DL) management system. It is realized by combining various specialized DL functionalities provided by partners of the DELOS network of excellence. Currently, DelosDLMS combines text and audio-visual searching, offers new information visualization and relevance feedback tools, provides novel interfaces, allows retrieved information to be annotated and processed, integrates and processes sensor data streams, and finally, from a systems engineering point of view, is easily configured and adapted while being reliable and scalable. The prototype is based on the OSIRIS/ISIS platform, a middleware environment developed by ETH Zurich and now being extended at the University of Basel.”
Copyrights may apply
» 2006 «
Frommholz, Ingo and Fuhr, Norbert (2006): Probabilistic, object-oriented logics for annotation-based retrieval in digital libraries. In: JCDL06: Proceedings of the 6th ACM/IEEE-CS Joint Conference on Digital Libraries 2006. pp. 55-64. Available online
“In this paper we introduce POLAR, a probabilistic object-oriented logical framework for annotation-based information retrieval. In POLAR, the knowledge about digital objects, annotations and their relationships in a digital library repository can be modelled considering certain characteristics of annotations and annotated objects. Insights about these characteristics are gained by an analysis of the annotation models behind existing systems and a discussion of an object-oriented, logical view on relevant objects in a digital library. Retrieval methods applied in a digital library should take annotations into account to satisfy users' information needs. POLAR thus supports a wide range of flexible and powerful annotation-based fact and content queries by making use of knowledge and relevance augmentation. An evaluation of our approach on email discussions shows performance improvements when annotation characteristics are considered.”
Copyrights may apply
Klas, Claus-Peter, Fuhr, Norbert, Kriewel, Sascha, Albrechtsen, Hanne, Tsakonas, Giannis, Kapidakis, Sarantos, Papatheodorou, Christos, Hansen, Preben, Kovacs, Laszlo, Micsik, Andras and Jacob, Elin (2006): An experimental framework for comparative digital library evaluation: the logging scheme. In: JCDL06: Proceedings of the 6th ACM/IEEE-CS Joint Conference on Digital Libraries 2006. pp. 308-309. Available online
“Evaluation of digital libraries assesses their effectiveness, quality and overall impact. In this paper we present a novel, multi-level logging framework that will provide complete coverage of the different aspects of DL usage for user-system interactions. Based on this framework, we can analyse for various DL stakeholders the logging data according to their specific interests. In addition, analysis tools and a freely accessible log data repository will yield synergies and sustainability in DL evaluation and encourage a community for DL evaluation by providing for discussion on a common ground.”
Copyrights may apply
» 2005 «
Herzog, Otthein, Schek, Hans-Jörg and Fuhr, Norbert (eds.) Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management October 31 - November 5, 2005, Bremen, Germany.
» 2004 «
Fuhr, Norbert and Grossjohann, Kai (2004): XIRQL: An XML query language based on information retrieval concepts. In ACM Transactions on Information Systems, 22 (2) pp. 313-356
“XIRQL ("circle") is an XML query language that incorporates imprecision and vagueness for both structural and content-oriented query conditions. The corresponding uncertainty is handled by a consistent probabilistic model. The core features of XIRQL are (1) document ranking based on index term weighting, (2) specificity-oriented search for retrieving the most relevant parts of documents, (3) datatypes with vague predicates for dealing with specific types of content and (4) structural vagueness for vague interpretation of structural query conditions. A XIRQL database may contain several classes of documents, where all documents in a class conform to the same DTD; links between documents also are supported. XIRQL queries are translated into a path algebra, which can be processed by our HyREX retrieval engine.”
Copyrights may apply
Kazai, Gabriella, Lalmas, Mounia, Fuhr, Norbert and Gövert, Norbert (2004): A report on the first year of the INitiative for the Evaluation of XML retrieval. In JASIST - Journal of the American Society for Information Science and Technology, 55 (6) pp. 551-556
» 2003 «
Nottelmann, Henrik and Fuhr, Norbert (2003): Evaluating different methods of estimating retrieval quality for resource selection. In: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 2003. pp. 290-297. Available online
“In a federated digital library system, it is too expensive to query every accessible library. Resource selection is the task to decide to which libraries a query should be routed. Most existing resource selection algorithms compute a library ranking in a heuristic way. In contrast, the decision-theoretic framework (DTF) follows a different approach on a better theoretic foundation: It computes a selection which minimises the overall costs (e.g. retrieval quality, time, money) of the distributed retrieval. For estimating retrieval quality the recall-precision function is proposed. In this paper, we introduce two new methods: The first one computes the empirical distribution of the probabilities of relevance from a small library sample, and assumes it to be representative for the whole library. The second method assumes that the indexing weights follow a normal distribution, leading to a normal distribution for the document scores. Furthermore, we present the first evaluation of DTF by comparing this theoretical approach with the heuristical state-of-the-art system CORI; here we find that DTF outperforms CORI in most cases.”
Copyrights may apply
» 2002 «
Fuhr, Norbert, Govert, Norbert and Grossjohann, Kai (2002): HyREX: hyper-media retrieval engine for XML. In: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 2002. p. 449. Available online
Fuhr, Norbert and Gövert, Norbert (2002): Index compression vs. retrieval time of inverted files for XML documents. In: Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management November 4-9, 2002, McLean, VA, USA. pp. 662-664. Available online
» 2001 «
Nottelmann, Henrik and Fuhr, Norbert (2001): Learning Probabilistic Datalog Rules for Information Classification and Transformation. In: Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management November 5-10, 2001, Atlanta, Georgia, USA. pp. 387-394. Available online
» 2000 «
Fuhr, Norbert (2000): Probabilistic datalog: Implementing logical information retrieval for advanced applications. In JASIST - Journal of the American Society for Information Science and Technology, 51 (2) pp. 95-110
» 1999 «
Fuhr, Norbert (1999): A decision-theoretic approach to database selection in networked IR. In ACM Transactions on Information Systems, 17 (3) pp. 229-249
“In networked IR, a client submits a query to a broker, which is in contact with a large number of databases. In order to yield a maximum number of documents at minimum cost, the broker has to make estimates about the retrieval cost of each database, and then decide for each database whether or not to use it for the current query, and if, how many documents to retrieve from it. For this purpose, we develop a general decision-theoretic model and discuss different cost structures. Besides cost for retrieving relevant versus nonrelevant documents, we consider the following parameters for each database: expected retrieval quality, expected number of relevant documents in the database and cost factors for query processing and document delivery. For computing the overall optimum, a divide-and-conquer algorithm is given. If there are several brokers knowing different databases, a preselection of brokers can only be performed heuristically, but the computation of the optimum can be done similarly to the single-broker case. In addition, we derive a formula which estimates the number of relevant documents in a database based on dictionary information.”
Copyrights may apply
Gövert, Norbert, Lalmas, Mounia and Fuhr, Norbert (1999): A Probabilistic Description-Oriented Approach for Categorizing Web Documents. In: Proceedings of the 1999 ACM CIKM International Conference on Information and Knowledge Management November 2-6, 1999, Kansas City, Missouri, USA. pp. 475-482. Available online
» 1998 «
Fuhr, Norbert, Govert, Norbert and Rolleke, Thomas (1998): DOLORES: A System for Logic-Based Retrieval of Multimedia Objects. In: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1998. pp. 257-265. Available online
“We describe the design and implementation of a system for logic-based multimedia retrieval. As high-level logic for retrieval of hypermedia documents, we have developed a probabilistic object-oriented logic (POOL) which supports aggregated objects, different kinds of propositions (terms, classifications and attributes) and even rules as being contained in objects. Based on a probabilistic four-valued logic, POOL uses an implicit open world assumption, allows for closed world assumptions and is able to deal with inconsistent knowledge. POOL programs and queries are translated into probabilistic Datalog programs which can be interpreted by the HySpirit inference engine. For storing the multimedia data, we have developed a new basic IR engine which yields physical data abstraction. The overall architecture and the flexibility of each layer supports logic-based methods for multimedia information retrieval.”
Copyrights may apply
Endres, Albert and Fuhr, Norbert (1998): Students Access Books and Journals through MeDoc. In Communications of the ACM, 41 (4) pp. 76-77
» 1997 «
Fuhr, Norbert and Rolleke, Thomas (1997): A Probabilistic Relational Algebra for the Integration of Information Retrieval and Database Systems. In ACM Transactions on Information Systems, 15 (1) pp. 32-66
“We present a probabilistic relational algebra (PRA) which is a generalization of standard relational algebra. In PRA, tuples are assigned probabilistic weights giving the probability that a tuple belongs to a relation. Based on intensional semantics, the tuple weights of the result of a PRA expression always conform to the underlying probabilistic model. We also show for which expressions extensional semantics yields the same results. Furthermore, we discuss complexity issues and indicate possibilities for optimization. With regard to databases, the approach allows for representing imprecise attribute values, whereas for information retrieval, probabilistic document indexing and probabilistic search term weighting can be modeled. We introduce the concept of vague predicates which yield probabilistic weights instead of Boolean values, thus allowing for queries with vague selection conditions. With these features, PRA implements uncertainty and vagueness in combination with the relational model.”
Copyrights may apply
Fuhr, Norbert (1997): Multimedia Information Retrieval. In: Proceedings of the 20th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1997. p. 343.
“The aim of this tutorial is to survey the state of the art in multimedia IR. The focus is on indexing and retrieval methods for multimedia, whereas system-oriented aspects will not be addressed. More specifically, the following major concepts are to be taught in the tutorial: * basic properties of text, images, audio, video * views on media objects: physical (layout), structural * (logical), symbolic, spatial, temporal, perceptive * modelling the structure of multimedia documents feature-based and semantic indexing methods for text, * images, speech, video * multimedia retrieval: classical IR models vs. logic-based approaches * retrieval of structured documents. Additional information can be found at the Web page of the MMIS course at the University of Dortmund: http://ls6-www.informatik.unidortmund.de/ir/teaching/courses/mmis/”
Copyrights may apply
Callan, Jamie, Buckley, Chris and Fuhr, Norbert (1997): Networked Information Retrieval. In: Proceedings of the 20th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1997. p. 345.
“The recent and rapid growth of the Internet and corporate intranets poses new problems for Information Retrieval. There is now a need for tools that help people navigate the network, select which collections to search, and fuse the results returned from searching multiple collections. These problems are being addressed by the international IR research community and a number of digital libraries projects around the world, such as the U.S. Digital Libraries projects, the ERCIM Digital Libraries projects and the German MEDOC project. The goal of this workshop is to bring together people from each of these areas to discuss their varying approaches to common problems. Researchers are invited to submit position papers or extended abstracts discussing novel approaches to the following problems: * Resource selection: selecting from among a set of collections or databases; * Data fusion: merging or fusing results from different collections or databases; * Browsing, summarization and visualization of distributed resources; * Archival retrieval methods for heterogeneous objects; * Metaknowledge; * Consistency; * Multilingual environments; * User interfaces; and * Architectures for networked information retrieval”
Copyrights may apply
» 1996 «
Rolleke, Thomas and Fuhr, Norbert (1996): Retrieval of Complex Objects Using a Four-Valued Logic. In: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1996. pp. 206-214. Available online
“The aggregated structure of documents plays a key role in full-text, multimedia, and network Information Retrieval (IR). Considering aggregation provides new querying facilities and improves retrieval effectiveness. We present a knowledge representation for IR purposes which pays special attention to this aggregated structure of objects. In addition, further features of objects can be described. Thus, the structure of full-text documents, the heterogeneity and the spatial and temporal relationships of objects typical for multimedia IR, and meta information for network IR are representable within one integrated framework. The model we propose allows for querying on the content of documents (objects) as well as on other features. The query result may contain objects having different types. Instead of retrieving only whole documents, the retrieval process determines the least aggregated entities that imply the query.”
Copyrights may apply
Fuhr, Norbert (1996): Networked Information Retrieval. In: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1996. p. 344. Available online
“The recent and rapid growth of the Internet and corporate intranets poses new problems for Information Retrieval. There is now a need for tools that help people navigate the network, select which collections to search, and fuse the results returned from searching multiple collections. These problems are being addressed by the international IR research community and a number of digital library projects around the world, e.g. the U.S. Digital Libraries projects, the ERCIM Digital Libraries projects, and the German MEDOC project. The goal of this workshop is to bring together people from each of these areas to discuss their varying approaches to common problems. Researchers are invited to submit position papers or extended abstracts discussing novel approaches to the following problems: * Resource selection: selecting from among a set of collections or databases; * Data fusion: merging or fusing results from different collections or databases; * Archival retrieval methods for heterogeneous objects; * Metaknowledge; * Consistency; * Multilingual environments; * User interfaces; and * Architectures for networked information retrieval.”
Copyrights may apply
Fuhr, Norbert (1996): Object-Oriented and Database Concepts for the Design of Networked Information Retrieval Systems. In: CIKM 96 - Proceedings of the Fifth International Conference on Information and Knowledge Management November 12 - 16, 1996, Rockville, Maryland, USA. pp. 164-172. Available online
» 1995 «
Pfeifer, Ulrich and Fuhr, Norbert (1995): Efficient Processing of Vague Queries using a Data Stream Approach. In: Proceedings of the Eighteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1995. pp. 189-197. Available online
“In this paper, we consider vague queries in text and fact databases. A vague query can be formulated as a combination of vague criteria. A single database object can meet a vague criterion to a certain degree. We confine ourselves to queries for which the answer can be computed efficiently by (perhaps repetitive) combination of rankings to new rankings. Since users usually will inspect some of the best answer objects only, the corresponding rankings need to be computed just as far as necessary to generate these first answer objects. In this contribution we describe an approach for estimating the number of elements needed from the basic rankings to compute a given number of elements of the resulting ranking. Experiments with a large text database prove the applicability of our approach.”
Copyrights may apply
Fuhr, Norbert (1995): Probabilistic Datalog -- A Logic for Powerful Retrieval Methods. In: Proceedings of the Eighteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1995. pp. 282-290. Available online
“In the logical approach to information retrieval, retrieval is considered as uncertain inference. Here we present a new, powerful inference method for this purpose which combines Datalog with probability theory on the basis of intensional semantics. We describe syntax and semantics of probabilistic Datalog and also present an evaluation method and a prototype implementation. This approach allows for easy formulation of specific retrieval models for arbitrary applications, and classical probabilistic IR models can be implemented by specifying the appropriate rules. In comparison to other approaches, the possibility of recursive rules allows for more powerful inferences. Finally, probabilistic Datalog can be used as a query language for integrated information retrieval and database systems.”
Copyrights may apply
» 1994 «
Fuhr, Norbert and Pfeifer, Ulrich (1994): Probabilistic Information Retrieval as a Combination of Abstraction, Inductive Learning, and Probabilistic Assumptions. In ACM Transactions on Information Systems, 12 (1) pp. 92-115
“We show that former approaches in probabilistic information retrieval are based on one or two of the three concepts abstraction, inductive learning, and probabilistic assumptions, and we propose a new approach which combines all three concepts. This approach is illustrated for the case of indexing with a controlled vocabulary. For this purpose, we describe a new probabilistic model first, which is then combined with logistic regression, thus yielding a generalization of the original model. Experimental results for the pure theoretical model as well as for heuristic variants are given. Furthermore, linear and logistic regression are compared.”
Copyrights may apply
Fuhr, Norbert, Larson, Ray R., Schauble, Peter, Schmidt, Joachim W. and Thiel, Ulrich (1994): Integration of Information Retrieval and Database Systems. In: Proceedings of the Seventeenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1994. p. 360. Available online
“The panelists will report on their current work as well as on their experience they have gained in the following projects. * Lassell/SEQOIA 2000 * MIND * NOSFERATU * SPIDER * Tycoon Among others the following issues will be discussed. 1. Extensible database systems supporting text retrieval by means of user defined functions and/or triggers. 2. Data models and retrieval models for semistructured data incorporating best-match retrieval and exact-match retrieval as special cases.”
Copyrights may apply
» 1993 «
Fuhr, Norbert (1993): A Probabilistic Relational Model for the Integration of IR and Databases. In: Proceedings of the Sixteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1993. pp. 309-317. Available online
“In this paper, a probabilistic relational model is presented which combines relational algebra with probabilistic retrieval. Based on certain independence assumptions, the operators of the relational algebra are redefined such that the probabilistic algebra is a generalization of the standard relational algebra. Furthermore, a special join operator implementing probabilistic retrieval is proposed. When applied to typical document databases, queries can not only ask for documents, but for any kind of object in the database. In addition, an implicit ranking of these objects is provided in case the query relates to probabilistic indexing or uses the probabilistic join operator. The proposed algebra is intended as a standard interface to combined database and IR systems, as a basis for implementing user-friendly interfaces.”
Copyrights may apply
» 1992 «
Fuhr, Norbert (1992): Integration of Probabilistic Fact and Text Retrieval. In: Proceedings of the Fifteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1992. pp. 211-222. Available online
“In this paper, a model for combining text and fact retrieval is described. A query is a set of conditions, where a single condition is either a text or fact condition. Fact conditions can be interpreted as being vague, thus leading to nonbinary weights for fact conditions with respect to database objects. For text conditions, we use descriptions of the occurrence of terms in documents instead of precomputed indexing weights, thus treating terms similar to attributes. Probabilistic indexing weights for conditions are computed by introducing the notion of correctness (or acceptability) of a condition w.r.t. an object. These indexing weights are used in retrieval for a probabilistic ranking of objects based on the retrieval-with-probabilistic-indexing (RPI) model, for which a new derivation is given here.”
Copyrights may apply
Croft, W. Bruce, Fuhr, Norbert, Harman, Donna and Stanfill, Craig (1992): Experience with Large Document Collections. In: Proceedings of the Fifteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1992. p. 347. Available online
» 1991 «
Fuhr, Norbert and Buckley, Chris (1991): A Probabilistic Learning Approach for Document Indexing. In ACM Transactions on Information Systems, 9 (3) pp. 223-248
“We describe a method for probabilistic document indexing using relevance feedback data that has been collected from a set of queries. Our approach is based on three new concepts: (1) Abstraction from specific terms and documents, which overcomes the restriction of limited relevance information for parameter estimation. (2) Flexibility of the representation, which allows the integration of new text analysis and knowledge-based methods in our approach as well as the consideration of document structures or different types of terms. (3) Probabilistic learning or classification methods for the estimation of the indexing weights making better use of the available relevance information. Our approach can be applied under restrictions that hold for real applications. We give experimental results for five test collections which show improvements over other methods.”
Copyrights may apply
Fuhr, Norbert and Pfeifer, Ulrich (1991): Combining Model-Oriented and Description-Oriented Approaches for Probabilistic Indexing. In: Proceedings of the Fourteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1991. pp. 46-56. Available online
“We distinguish model-oriented and description-oriented approaches in probabilistic information retrieval. The former refer to certain representations of documents and queries and use additional independence assumptions, whereas the latter map documents and queries onto feature vectors which form the input to certain classification procedures or regression methods. Description-oriented approaches are more flexible with respect to the underlying representations, but the definition of the feature vector is a heuristic step. In this paper, we combine a probabilistic model for the Darmstadt Indexing Approach with logistic regression. Here the probabilistic model forms a guideline for the definition of the feature vector. Experiments with the purely theoretical approach and with several heuristic variations show that heuristic assumptions may yield significant improvements.”
Copyrights may apply
» 1990 «
Fuhr, Norbert and Buckley, Chris (1990): Probabilistic Document Indexing from Relevance Feedback Data. In: Proceedings of the Thirteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1990. pp. 45-61.
“Based on the binary independence indexing model, we apply three new concepts for probabilistic document indexing from relevance feedback data: 1. Abstraction from specific terms and documents, which overcomes the restriction of limited relevance information for parameter estimation. 2. Flexibility of the representation, which allows the integration of new text analysis and knowledge-based methods in our approach as well as the consideration of more complex document structures or different types of terms (e.g. single words and noun phrases). 3. Probabilistic learning or classification methods for the estimation of the indexing weights making better use of the available relevance information. We give experimental results for five test collections which show improvements over other indexing methods.”
Copyrights may apply
» 1989 «
Fuhr, Norbert (1989): Optimal Polynomial Retrieval Functions Based on the Probability Ranking Principle. In ACM Transactions on Information Systems, 7 (3) pp. 183-204
“We show that any approach to developing optimum retrieval functions is based on two kinds of assumptions: first, a certain form of representation for documents and requests, and second, additional simplifying assumptions that predefine the type of the retrieval function. Then we describe an approach for the development of optimum polynomial retrieval functions: request-document pairs (f{sub:l},d{sub:m}) are mapped onto description vectors x(f{sub:l},d{sub:m}), and a polynomial function e(x) is developed such that it yields estimates of the probability of relevance P(R|x(f{sub:l},d{sub:m})) with minimum square errors. We give experimental results for the application of this approach to documents with weighted indexing as well as to documents with complex representations. In contrast to other probabilistic models, our approach yields estimates of the actual probabilities, it can handle very complex representations of documents and requests, and it can be easily applied to multivalued relevance scales. On the other hand, this approach is not suited to log-linear probabilistic models and it needs large samples of relevance feedback data for its application.”
Copyrights may apply
Fuhr, Norbert (1989): Optimum Polynomial Retrieval Functions. In: Proceedings of the Twelfth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1989. pp. 69-76.
“We show that any approach to develop optimum retrieval functions is based on two kinds of assumptions: first, a certain form of representation for documents and requests, and second, additional simplifying assumptions that predefine the type of the retrieval function. Then we describe an approach for the development of optimum polynomial retrieval functions: request-document pairs (f{sub:l},d{sub:m}) are mapped onto description vectors x(f{sub:l},d{sub:m}), and a polynomial function of the form a{sup:T}{times}v(x) is developed such that it yields estimates of the probability of relevance P(R|x(f{sub:l},d{sub:m}) with minimum square errors. We give experimental results for the application of this approach to documents with weighted indexing as well as to documents with complex representations. In contrast to other probabilistic models, our approach yields estimates of the actual probabilities, it can handle very complex representations of documents and requests, and it can be easily applied to multi-valued relevance scales. On the other hand, this approach is not suited to log-linear probabilistic models, and it needs large samples of relevance feedback data for its application.”
Copyrights may apply
» 1988 «
Fuhr, Norbert and Huther, Hubert (1988): Optimum Probability Estimation Based on Expectations. In: Proceedings of the Eleventh Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1988. pp. 257-273.
“Probability estimation is important for the application of probabilistic models as well as for any evaluation in IR. We discuss the interdependencies between parameter estimation and other properties of probabilistic models. Then we define an optimum estimate which can be applied to various typical estimation problems in IR. A method for the computation of this estimate is described which uses expectations from empirical distributions. Some experiments show the applicability of our method, whereas comparable approaches are partially based on false assumptions or yield estimates with systematic errors.”
Copyrights may apply
Biebricher, Peter, Fuhr, Norbert, Lustig, Gerhard, Schwantner, Michael and Knorz, Gerhard (1988): The Automatic Indexing System AIR/PHYS -- From Research to Application. In: Proceedings of the Eleventh Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1988. pp. 333-342.
“Since October 1985, the automatic indexing system AIR/PHYS has been used in the input production of the physics data base of the Fachinformationszentrum Karlsruhe/West Germany. The texts to be indexed are abstracts written in English. The system of descriptors is prescribed. For the application of the AIR/PHYS system a large-scale dictionary containing more than 600000 word-descriptor relations resp. phrase-descriptor relations has been developed. Most of these relations have been obtained by means of statistical and heuristical methods. In consequence, the relation system is rather imperfect. Therefore, the indexing system needs some fault-tolerating features. An appropriate indexing approach and the corresponding structure of the AIR/PHYS system are described. Finally, the conditions of the application as well as problems of further development are discussed.”
Copyrights may apply
» 1987 «
Fuhr, Norbert and Muller, Peter (1987): Probabilistic Search Term Weighting-Some Negative Results. In: Proceedings of the Tenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1987. pp. 13-18.
“The effect of probabilistic search term weighting on the improvement of retrieval quality has been demonstrated in various experiments described in the literature. In this paper, we investigate the feasibility of this method for boolean retrieval with terms from a prescribed indexing vocabulary. This is a quite different test setting in comparison to other experiments where linear retrieval with free text terms was used. The experimental results show that in our case no improvement over a simple coordination match function can be achieved. On the other hand, models based on probabilistic indexing outperform the ranking procedures using search term weights.”
Copyrights may apply
» 1986 «
Fuhr, Norbert (1986): Two Models of Retrieval with Probabilistic Indexing. In: Proceedings of the Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1986. pp. 249-257.
“We describe two retrieval models for probabilistic indexing. The binary independence indexing (BII) model is a generalized version of the Maron & Kuhns indexing model. In this model, the indexing weight of a descriptor in a document is an estimate of the probability of relevance of this document with respect to queries using this descriptor. The retrieval-with probabilistic-indexing (RPI) model is suited to different kinds of probabilistic indexing. Therefore we assume that each indexing model has its own concept of 'correctness' to which the probabilities relate. The concept of correctness is not necessarily identical with the concept of relevance, it is only required to depend on relevance. In addition to the probabilistic indexing weights, the RPI model provides the possibility of relevance weighting of search terms. Both retrieval models are compared in experiments, showing equally good results.”
Copyrights may apply
SHOW THIS LIST ON YOUR HOMEPAGE
What do YOU think?
Give us your opinion! Do you have any comments/additions
that you would like other visitors to see?
You say:
Mar 22nd, 2010
Changes to this page (author)
27 Feb 2010: Enabled abstracts to be shown on Norbert Fuhr's author page.17 Aug 2009: Author was edited 01 Jun 2009: Author was edited
31 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
29 May 2009: Author was edited
22 May 2008: Author was added to the bibliography (approved by an editor)
24 Jul 2007: Author was edited
25 Jun 2007: Author was edited
25 Jun 2007: Author was edited
25 Jun 2007: Author was edited
25 Jun 2007: Author was edited
25 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
24 Jun 2007: Author was edited
23 Jun 2007: Author was edited
28 Apr 2003: Added the author to the bibliography
