BibSonomy publications for /tag/irSat Feb 11 07:16:30 CET 2012Palo Alto, California, {USA}{WSDM} '08: Proceedings of the international conference on Web search and web data mining195--206Can social bookmarking improve web search?2008case-study delicious ir social-search tagging Social bookmarking is a recent phenomenon which has the potential to give us a great deal of data about pages on the web. One major question is whether that data can be used to augment systems like web search. To answer this question, over the past year we have gathered what we believe to be the largest dataset from a social bookmarking site yet analyzed by academic researchers. Our dataset represents about forty million bookmarks from the social bookmarking site del.icio.us. We contribute a characterization of posts to del.icio. us: how many bookmarks exist (about 115 million), how fast is it growing, and how active are the {URLs} being posted about (quite active). We also contribute a characterization of tags used by bookmarkers. We found that certain tags tend to gravitate towards certain domains, and vice versa. We also found that tags occur in over 50 percent of the pages that they annotate, and in only 20 percent of cases do they not occur in the page text, backlink page text, or forward link page text of the pages they annotate. We conclude that social bookmarking can provide search data not currently provided by other sources, though it may currently lack the size and distribution of tags necessary to make a significant impactWed Jan 18 15:57:00 CET 2012cite arxiv:1112.0343Comment: Extended version of "Ontological Queries: Rewriting and Optimization" presented at ICDE 2011Ontological Queries: Rewriting and Optimization (Extended Version)2011ir ontology owl query_reformulation rdf semantic_web Ontological queries are evaluated against an ontology rather than directly on a database. The evaluation and optimization of such queries is an intriguing new problem for database research. In this paper we discuss two important aspects of this problem: query rewriting and query optimization. Query rewriting consists of the compilation of an ontological query into an equivalent query against the underlying relational database. The focus here is on soundness and completeness. We review previous results and present a new rewriting algorithm for rather general types of ontological constraints. In particular, we show how a conjunctive query against an ontology can be compiled into a union of conjunctive queries against the underlying database. Ontological query optimization, in this context, attempts to improve this process so to produce possibly small and cost-effective UCQ rewritings for an input query. We review existing optimization methods, and propose an effective new method that works for linear Datalog+/-, a class of Datalog-based rules that encompasses well-known description logics of the DL-Lite family. Wed Jan 18 15:56:22 CET 2012Lightweight Integration of IR & DB for Scalable Hybrid Search with Integrated Ranking Support2011database ir search semantic_web Wed Jan 18 14:21:41 CET 2012apresta/tagger2012automatic_tagging ir module nocache python tagging Wed Jan 18 12:21:50 CET 2012Lightweight Integration of IR & DB for Scalable Hybrid Search with Integrated Ranking Support2011database ir search semantic_web Sat Jan 07 20:55:18 CET 2012Philadelphia, PA, USASIAM J. Sci. Comput.November1181--1201Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization272005hits initialization ir pagerank search Algorithms such as Kleinberg's HITS algorithm, the PageRank algorithm of Brin and Page, and the SALSA algorithm of Lempel and Moran use the link structure of a network of web pages to assign weights to each page in the network. The weights can then be used to rank the pages as authoritative sources. These algorithms share a common underpinning; they find a dominant eigenvector of a nonnegative matrix that describes the link structure of the given network and use the entries of this eigenvector as the page weights. We use this commonality to give a unified treatment, proving the existence of the required eigenvector for the PageRank, HITS, and SALSA algorithms, the uniqueness of the PageRank eigenvector, and the convergence of the algorithms to these eigenvectors. However, we show that the HITS and SALSA eigenvectors need not be unique. We examine how the initialization of the algorithms affects the final weightings produced. We give examples of networks that lead the HITS and SALSA algorithms to return nonunique or nonintuitive rankings. We characterize all such networks in terms of the connectivity of the related HITS authority graph. We propose a modification, Exponentiated Input to HITS, to the adjacency matrix input to the HITS algorithm. We prove that Exponentiated Input to HITS returns a unique ranking, provided that the network is weakly connected. Our examples also show that SALSA can give inconsistent hub and authority weights, due to nonuniqueness. We also mention a small modification to the SALSA initialization which makes the hub and authority weights consistent.Wed Jan 04 17:22:18 CET 2012PCT PatentdecWO 00/79779 A2, PCT1lB00/00896System and Method for Differentiating between Image Foreground and Background in an Image based on an Invisible Keying Signal2000IR UV keying segmentation tv 28Arrangements are described for differentiating between image foreground and background in an image based on an invisible keying signal, in particular, different polarization characteristics in the light represention the foreground and background. This facilitates, for example, generating of a matte that is useful in separating the foreground from the background which can allow for substituting a background from a different image with the foreground in a composite image. In particular, image recording studio systems are described for generating images that can be processed to provide a matte useful in separating foreground objects from a background. In one image recording studio, foreground objects are illuminated from in front (that is, towards a camera) by non-polarized light, and polarized light is provided as a back light. In another image recording studio, both foreground objects and a background screen are illuminated from in front by polarized light; for that studio, the surface of the background screen is selected to be such as, when light is reflected therefrom, to maintain the polarization characteristics of the reflected light, but surfaces of the foreground objects are selected to depolarize light reflected therefrom. In both cases, the images are recorded for, for example, processing to generate a matte useful in segregating the foreground objects from the background objects. A matte generation system useful in generating a matte from images recorded by the image recording studio systems is also described. In one matte generating system, an image recorded by the image recording studio system may be divided into light and dark images, either by the matte generation system itself or the image recording studio system. In the light image, the background appears relatively light, and, in the dark image, the background appears relatively dark, with the foreground objects appearing approximately the same intensity in both images. The matte generation system generates a matte in relation to the absolute brightness as between the light and dark images, in one embodiment employing a non-linear sigmoid function.Wed Jan 04 17:05:10 CET 2012US PatentmarUS 2008/0056568 A1Object Segmentation Using Visible and Infrared Images2006IR keying segmentation 6A method tracks an object. A sequence of visible images and a sequence of infrared images are acquired concurrently of a scene. A visible background image is maintained from each current visible image, while an infrared background image is maintained from each current infrared image. Each current visible image and the visible background image, and each current infrared image and the infrared background image are compared to generate corresponding changed pixels. Shadow pixels and reflectance pixels are discarded from the changed pixels to identify foreground pixels associated with an object in the scene.Wed Jan 04 16:40:07 CET 2012marUS 6,198,503 B1Infra-Red Video Key2001IR keying studio virtual 6A method and apparatus to isolate the video image of an object, usually a human being, from its background for use in forming a composite image. The viewer’s image is modified by replacing, from an independent visible image source, that area corresponding to the cold (non-viewer) areas of the infra-red image.Tue Jan 03 14:42:30 CET 2012MünsterGeschichte(n) im Netzwerk : Hypertext und dessen Potenziale für die Produktion, Repräsentation und Rezeption der historischen Erzählung2007FOA bachelor:2011:bachmann ir Was passiert mit Geschichte, wenn sie sich in hypertextuelle Netzwerke verstrickt? Der Historiker und erfahrene Hypertextpraktiker Krameritsch nähert sich dieser Frage mit medien- und kulturhistorischem Rüstzeug. In Auseinandersetzung mit der typographischen Informations- und Kommunikationstechnologie in der Frühen Neuzeit wird ein heuristsicher Rahmen entwickelt, der für jedwede Untersuchung einer "Medialität von Wissen" fruchtbar gemacht werden kann. Hypertext, eine Schlüsseltechnologie des WWW, geht mit der Versprechung einher, Dokumente und Menschen zu vernetzen. Entpuppt sich dies nun als Mythos, als eine auf das Medium projizierte naive Heilserwartung oder stellen hypertextuelle Spezifika vielmehr zentrale Paradigmen künftiger wissenschaftlicher Tätigkeiten dar? Die kritische und liebevolle Annäherung an Möglichkeiten und Grenzen der "Spielwiese Hypertext" für die (Geschichts-)Wissenschaften und deren Rezipient/inn/en bietet nicht zuletzt zahlreiche Anregungen für den Einsatz von Hypertext im (hoch-)schulischen Unterricht.Tue Jan 03 14:31:28 CET 2012Amsterdam; New York; New York, N.Y., U.S.A.Intelligent information systems for the information society : proceedings of the Sixth International Research Forum in Information Science (IRFIS 6), Frascati, Italy, September 16-18, 19851986FOA bachelor:2011:bachmann ir Fri Dec 30 21:26:02 CET 2011CambridgeJuliIntroduction to Information Retrieval2008book information ir retrieval Wed Dec 21 07:42:51 CET 2011SIGIRconf/sigir/2003205-212Query length in interactive information retrieval.2003interactive ir query query_length Tue Dec 20 20:04:47 CET 2011Journal of the American Society for Information Science and Technology10913--925The concept of relevance in IR542003IR concept informationretrieval relevance This article introduces the concept of relevance as viewed and applied in the context of IR evaluation, by presenting an overview of the multidimensional and dynamic nature of the concept. The literature on relevance reveals how the relevance concept, especially in regard to the multidimensionality of relevance, is many faceted, and does not just refer to the various relevance criteria users may apply in the process of judging relevance of retrieved information objects. From our point of view, the multidimensionality of relevance explains why some will argue that no consensus has been reached on the relevance concept. Thus, the objective of this article is to present an overview of the many different views and ways by which the concept of relevance is used—leading to a consistent and compatible understanding of the concept. In addition, special attention is paid to the type of situational relevance. Many researchers perceive situational relevance as the most realistic type of user relevance, and therefore situational relevance is discussed with reference to its potential dynamic nature, and as a requirement for interactive information retrieval (IIR) evaluation.Thu Dec 15 14:43:26 CET 2011Wissensrepräsentation. Informationen auswerten und bereitstellen.(2008)IR irhhu klassifikation Wed Dec 14 11:16:41 CET 2011cite arxiv:1112.2807Comment: 9 pages, 5 figures, to appear in Int'l J Software Engineering and Its Applications (Jan 2011)Design and Implementation of a Simple Web Search Engine2011ir python search_engine web We present a simple web search engine for indexing and searching html documents using python programming language. Because python is well known for its simple syntax and strong support for main operating systems, we hope it will be beneficial for learning information retrieval techniques, especially web search engine technology. Mon Dec 12 12:17:29 CET 2011cite arxiv:1112.2071Comment: 16 pages,9 figuresThematic Analysis and Visualization of Textual Corpus2011corpus ir visualization The semantic analysis of documents is a domain of intense research at present. The works in this domain can take several directions and touch several levels of granularity. In the present work we are exactly interested in the thematic analysis of the textual documents. In our approach, we suggest studying the variation of the theme relevance within a text to identify the major theme and all the minor themes evoked in the text. This allows us at the second level of analysis to identify the relations of thematic associations in a textual corpus. Through the identification and the analysis of these association relations we suggest generating thematic paths allowing users, within the frame work of information search system, to explore the corpus according to their themes of interest and to discover new knowledge by navigating in the thematic association relations. Fri Dec 09 09:59:44 CET 2011Umweltinformatik '98ISBN 3-89518-216-8583-596Metainformationsmodelle für flexibles Information Retrieval in vernetzten Umweltinformationsstrukturen1998eos ir meta_information_model metadata toread Tue Dec 06 09:55:46 CET 2011cite arxiv:1112.0343Comment: Extended version of "Ontological Queries: Rewriting and Optimization" presented at ICDE 2011Ontological Queries: Rewriting and Optimization (Extended Version)2011ir ontology owl query_reformulation rdf semantic_web Ontological queries are evaluated against an ontology rather than directly on a database. The evaluation and optimization of such queries is an intriguing new problem for database research. In this paper we discuss two important aspects of this problem: query rewriting and query optimization. Query rewriting consists of the compilation of an ontological query into an equivalent query against the underlying relational database. The focus here is on soundness and completeness. We review previous results and present a new rewriting algorithm for rather general types of ontological constraints. In particular, we show how a conjunctive query against an ontology can be compiled into a union of conjunctive queries against the underlying database. Ontological query optimization, in this context, attempts to improve this process so to produce possibly small and cost-effective UCQ rewritings for an input query. We review existing optimization methods, and propose an effective new method that works for linear Datalog+/-, a class of Datalog-based rules that encompasses well-known description logics of the DL-Lite family. Tue Dec 06 07:56:41 CET 2011AprilUnderstanding and Leveraging the Social Web for Information Retrieval2010ir phd social-tagging thesis irCommunity for tag(s) ir