2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1985 1984 1982 1980 1979 1978 1977 1976 1975
Journals Conferences Reports
Arampatzis, A.T. and Tsoris, T. and Koster, C.H.A. and Weide, Th.P. van der, Phrase-based Information Retrieval. Information Processing & Management, Nr: 6, Vol: 34, Pages: 693-707, December, 1998
In this article we describe a retrieval schema which goes beyond the classical information retrieval keyword hypothesis and takes into account also linguistic variation. Guided by the failures and successes of other state-of-the-art approaches, as well as our own experience with the Irena system, our approach is based on phrases and incorporates linguistic resources and processors. In this respect, we introduce the Phrase Retrieval Hypothesis to replace the Keyword Retrieval Hypothesis. We suggest a representation of phrases suitable for indexing, and an architecture for such a retrieval system. Syntactical normalization is introduced to improve retrieval effectiveness. Morphological and lexicosemantical normalizations are adjusted to fit in this model.
Weide, Th.P. van der and Huibers, T.W.C. and Bommel, P. van, The Incremental Searcher Satisfaction Model for Information Retrieval. The Computer Journal, Nr: 5, Vol: 41, Pages: 311-318, 1998
In this article, the incremental searcher satisfaction model for Information Retrieval is introduced. In this new model, documents are not presented according to decreasing relevancy only, but also on the level of novelty in the context of the documents previously presented. Documents which are judged to be insufficiently surprising (according to a searcher determined threshold) are not presented to the searcher. This is especially useful for Information Retrieval in certain contexts (e.g. Internet applications such as search engines), when a searcher does not want all relevant documents to be shown, but only have a global idea of the variety of what the corpus may contain on a topic. Important properties of this model are discussed, such as the relation between the reductional effect and the order of presentation.
[ cite ]
Wondergem, B.C.M. and Bommel, P. van and Weide, Th.P. van der, Nesting and Defoliation of Index Expressions for Information Retrieval. Knowledge and Information Systems, Vol: 2, Pages: 33-52, 1998
In this article, a formalisation of index expressions is presented. Index expressions are more expressive than keywords while maintaining a comprehensible complexity. Index expressions are well-known in Information Retrieval (IR), where they are used for characterising document contents, formulation of user interests, and matching mechanisms. In addition, index expressions have found both practical and theoretical applicability in 2-level hypermedia systems for IR. In these applications, properties of (the structure of) index expressions are heavily relied upon. However, the presupposed mathematical formalisation of index expressions and their properties still lacks. Our formalism is based on the structural notation of index expressions. It is complete in the sense that several notions of subexpressions and defoliation of index expressions are also formalised. Defoliation, which plays an important role in defining properties of index expressions, is provided as a recursively defined operator. Finally, two other representational formalisms for index expressions are compared to ours.
[ cite ]
Wondergem, B.C.M. and Bommel, P. van and Weide, Th.P. van der and Huibers, T.W.C., De Elektronische Informatiemakelaar. Informatie Professional, Nr: 11, Vol: 2, 1998
Vernieuwd! Verbeterd! Nu met extra witbeschermer, of zelfs gebaseerd op liposomen. Kreten over wasmiddelen en schoonheidscremepjes die aangeven dat het produkt ingrijpend verbeterd is. Of toch slechts simpelweg reclamepraat? Iets gelijks lijkt er aan de hand in de wereld van zoeksystemen en Information Retrieval. Agents! Proaktief! Intelligent! Zijn het loze kreten die alleen goed klinken en goed verkopen? Trouwens, wat zijn agenten eigenlijk? Is er ueberhaupt een werkbare definitie van het begrip agent te geven? Hoe ziet de opbouw van een zoeksysteem gebaseerd op agenten er uit? En wat is nu precies de rol die agenten kunnen spelen in een zoeksysteem? En, leidt het gebruik van agenten echt tot verbetering van zoeksystemen? Een checklist van eigenschappen voor het begrip 'agent'.
[ cite ]
Journals Conferences Reports
Bommel, P. van and Weide, Th.P. van der, Multi Media Information Filtering on the WWW. Proceedings of the World Automation Congress, May, TSI Press, Anchorage, Alaska, USA, 1998
The focus of this paper is information filtering on the World Wide Web. A conceptual model for characterizing information objects is discussed. The information to be filtered may be of various kinds, including images and sound. The central idea behind the framework is that Information Modelling techniques (e.g. NIAM, ER, OO) should be used for the characterization of information objects to be retrieved. This brings together two worlds which were separated for a long time: Information Modelling (IM) and Information Retrieval (IR, or: document retrieval). Although IM is in most cases used for traditional (nondocument) databases such as relational databases (e.g. SQL), our Information Filtering project PROFILE applies these techniques in order to obtain different characterization levels for information objects.
[ cite ]
Bosman, F.J.M. and Bruza, P.D. and Weide, Th.P. van der and Weusten, L.V.M., Documentation, Cataloging and Query by Navigation: A Practical and Sound Approach. Research and Advanced Technology for Digital Libraries, 2nd European Conference on Digital Libraries `98, ECDL `98, Heraklion, Crete, Greece, EU, Edited by: C. Nikolaou, and C. Stephanidis. Lecture Notes in Computer Science, Vol: 1513, Pages: 459-478, September, Springer, 1998
In this paper we discuss the construction of an automated information system for a medium-sized collection of visual reproductions of art objects. Special attention is payed to the economical aspects of such a system, which appears to be mainly a problem of data entry. An approach is discussed to make this feasible, which also strongly provokes consistency between descriptions.
Another main target of such a system is the capability for effective disclosure. This requires a disclosure mechanism on descriptions which is easy to handle by non technical users. We show the usefulness of query by navigation for this purpose. It allows the searcher to stepwise build a query in terms of (semi-)natural language. At each step, the searcher is presented with context sensitive information.
The resulting system is described and we discuss an experiment of its use.
[ cite ]
Wondergem, B.C.M. and Bommel, P. van and Weide, Th.P. van der, Construction and Applications of the Association Index Architecture. Proceedings of the Conferentie Informatiewetenschap (CIW`98), December, 1998
Information Discovery (ID) is the synthesis of Information Retrieval (IR) and Information Filtering (IF). In ID, information brokers act as intermediaries between users and sources. Information about user interests and document content can be modeled by 2-level hypermedia representations. These representations allow navigational mechanisms which have proven their effectiveness in IR applications.
Information brokers should thus combine two 2-level hypermedia representations to obtain an overall information structure necessary for the synthesis of IR and IF. For this, we propose the so called Association Index Architecture (AIA) which consists of two 2-level hypermedia representations which are connected thorugh a third level which is coined the association index. The AIA this forms a 3-level hypermedia representation. Information brokers can perform their actions in the AIA to implement their IR anf IF related tasks. The AIA is shown to be a general symbolic architecture for combining knowledge by illustrating how a number of ID applications can be performed in it.
[ cite ]
Wondergem, B.C.M. and Bommel, P. van and Huibers, T.W.C. and Weide, Th.P. van der, Agents in Cyberspace - Towards a Framework for Multi-Agent Systems in Information Discovery. Proceedings of the 20th BCS-IRSG Colloquium on IR Research, CLIPS-IMAGGrenoble, France, EU, 1998
This article proposes a formal framework for Multi-Agent Systems in the context of Information Discovery. Information Discovery is a synthesis of Information Retrieval and Information Filtering. The Information Discovery Paradigm is given. In addition, the different types of agents needed in Information Discovery applications are described in terms of the operations they support and the knowledge and the information they use. A correct filtering topology, consisting of sound filter paths, is identified. Three fields are identified in which Information Retrieval and Information Filtering benefit from their synthesis: query expansion, query generation or autonomous IR, and profile adaption.
[ cite ]
Wondergem, B.C.M. and Bommel, P. van and Huibers, T.W.C. and Weide, Th.P. van der, Domain Knowledge in Preferential Models. Proceedings of the third Baltic Workshop DB&IS98, Edited by: J. Barzdins. Vol: 1, Pages: 126 - 138, April, 1998
In Information Retrieval, user preferences and domain knowledge play an important role. This article shows how to incorporate domain knowledge in a logical framework and provides a mechanism to exploit user preferences for personalizing domain knowledge, based on the inferences made in the matching functions. The matching functions are essentially symbolic logical inferences. The logic used in this article is that of Preferential Models, which is augmented with domain knowledge by providing an enriched aboutness relation. However, the techniques described in this article are applicable to other logics as well. A way to personalize the domain knowledge is given, which also gives the user insight into the workings of the matching functions. In addition, sound inference rules, which are tailor-made for the domain knowledge, are provided.
[ cite ]
Wondergem, B.C.M. and Bommel, P. van and Weide, Th.P. van der, Cumulative Duality in Designing Information Brokers. Proceedings of the 9th International Conference on Database and Expert Systems Applications (DEXA), August, 1998
The focus of this paper is information brokers within Information Discovery (ID). We describe Cumulative Duality matrices, an instrument to deal with design criteria for such information brokers. ID is the synthesis of Information Retrieval and Information Filtering, where information brokers act as middleagents. There are numerous design criteria for information brokers. Since these stem from ID, they exhibit a dual nature. The duality of the criteria is shown to be cumulative. In the form of a matrix, cumulative duality can be used as a design instrument for information brokers.
[ cite ]
Wondergem, B.C.M. and Bommel, P. van and Huibers, T.W.C. and Weide, Th.P. van der, Opportunities for Electronic Commerce in Information Discovery. Proceedings of the International IFIP/GI Working Conference on Trends in Distributed Systems for Electronic Commerce, TrEC 98, Edited by: F. Griffel, T. Tu, and W. Lamersdorf. Pages: 126-136, June, 1998
This article investigates the connection between Electronic Commerce (EC) and Information Discovery (ID). ID is the synthesis of distributed Information Retrieval and Information Filtering, filled in with intelligent agents and information brokers. Currently, no link exists between EC and ID. We argue that this link consists of a cost model for ID. We therefore propose several (types of) cost models, which enable application of EC to the whole of ID. This is illustrated with examples.
[ cite ]
Journals Conferences Reports
Jones, P.A. and Koster, C.H.A. and Bommel, P. van and Weide, Th.P. van der, Critical Reference Counting. Technical report: CSI-R9825, Information Systems Group, Computing Science Institute, University of Nijmegen, The Netherlands, 1998
[ cite ]
Weide, Th.P. van der and Bommel, P. van, Individual and collective approaches for searcher satisfaction in IR. Technical report: CSI-R9819, Information Systems Group, Computing Science Institute, University of Nijmegen, The Netherlands, 1998
The incremental searcher satisfaction model for Information Retrieval has been introduced to capture the relevancy of documents under consideration of documents previously presented. In this paper, different approaches for the construction of increment functions are identified, such as the individual and the collective approach. The requirements posed by these approaches are examined and evaluated with respect to well-known similarity measures used in IR, such as Inclusion, Jaccard's, Dice's, and Cosine coefficient.
[ cite ]
Wondergem, B.C.M. and Bommel, P. van and Weide, Th.P. van der, Association Index Architecture for Information Brokers. Technical report: CSI-R9820, July, University of Nijmegen, 1998
Information Discovery (ID) is the synthesis of Information Retrieval (IR) and Information Filtering (IF). In ID, broker agents act as intermediaries between user agents and source agents. Information about user interests and documents in sources can be modeled by 2-level hypermedia representations. These representations allow navigational mechanisms which have proven their effectiveness in IR applications. Broker agents should thus combine two 2-level hypermedia representations to obtain an overall information structure necessary for the synthesis of IR and IF. For this, we propose the so called Association Index Architecture (AIA) which consists of two 2-level hypermedia representations which are connected through a third level which is coined the association index. The AIA thus forms a 3-level hypermedia representation. Broker agents can perform actions in the AIA to implement their IR and IF related tasks. The AIA is shown to be a general symbolic architecture for combining knowledge by illustrating how a number of ID applications can be performed in it.
[ cite ]
Wondergem, B.C.M. and Bommel, P. van and Weide, Th.P. van der, Boolean Index Expressions for Information Retrieval. Technical report: CSI-R9827, December, University of Nijmegen, 1998
Keywords still seem to form the basis for document content and query representation. Approaches to use more advanced linguistic structures, such as noun phrases, still are in an experimental phase. In addition, Boolean descriptor languages have often been applied for Information Retrieval. However, the synthesis of logic and linguistics in one descriptor language still is an open issue. In this paper, Boolean index expressions, combining Boolean logic and linguistic structure, are proposed as a good balance between expresiveness and practical issues. Boolean index expressions are obtained by augmenting regular index expressions with logical operators for disjunction, conjunction, and negation. Boolean index expressions are more expressive than both index expressions and the Boolean query language based on keywords. They allow a compact representation of logical combinations of index expressions. In addition, Boolean index expressions are still efficiently parsible and their meaning can be deter- mined through their structure. It is shown how Boolean index expressions can be brought into normal form, allowing fast numerical matching. Matching strategies for Boolean index expressions are obtained by adapting matching strategies for index expressions by providing a case for negations. Our implementation of Boolean index expressions illustrates mentioned issues.
[ cite ]