Search (109 results, page 1 of 6)

0.048947945 = product of:
  0.09789589 = sum of:
    0.09789589 = sum of:
      0.048581023 = weight(_text_:search in 4330) [ClassicSimilarity], result of:
        0.048581023 = score(doc=4330,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.2688082 = fieldWeight in 4330, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4330)
      0.049314864 = weight(_text_:22 in 4330) [ClassicSimilarity], result of:
        0.049314864 = score(doc=4330,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.2708308 = fieldWeight in 4330, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4330)
  0.5 = coord(1/2)

Abstract

One vision of the Semantic Web is that it will be much like the Web we know today, except that documents will be enriched by annotations in machine understandable markup. These annotations will provide metadata about the documents as well as machine interpretable statements capturing some of the meaning of document content. We discuss how the information retrieval paradigm might be recast in such an environment. We suggest that retrieval can be tightly bound to inference. Doing so makes today's Web search engines useful to Semantic Web inference engines, and causes improvements in either retrieval or inference to lead directly to improvements in the other.

Date

12. 2.2011 17:35:22

0.041955378 = product of:
  0.083910756 = sum of:
    0.083910756 = sum of:
      0.041640874 = weight(_text_:search in 2556) [ClassicSimilarity], result of:
        0.041640874 = score(doc=2556,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.230407 = fieldWeight in 2556, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.046875 = fieldNorm(doc=2556)
      0.04226988 = weight(_text_:22 in 2556) [ClassicSimilarity], result of:
        0.04226988 = score(doc=2556,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.23214069 = fieldWeight in 2556, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=2556)
  0.5 = coord(1/2)

Abstract

First generation scholarly research on the Web lacked a firm system of authority control. Second generation Web research is beginning to model subject access with library science principles of bibliographic control and cataloguing. Harnessing the Web and organising the intellectual content with standards and controlled vocabulary provides precise search and retrieval capability, increasing relevance and efficient use of technology. Dublin Core metadata standards permit a full evaluation and cataloguing of Web resources appropriate to highly specific research needs and discovery. Current research points to a type of structure based on a system of faceted classification. This system allows the semantic and syntactic relationships to be defined. Controlled vocabulary, such as the Library of Congress Subject Headings, can be assigned, not in a hierarchical structure, but rather as descriptive facets of relating concepts. Web design features such as this are adding value to discovery and filtering out data that lack authority. The system design allows for scalability and extensibility, two technical features that are integral to future development of the digital library and resource discovery.

Date

30.12.2008 18:22:46

0.041955378 = product of:
  0.083910756 = sum of:
    0.083910756 = sum of:
      0.041640874 = weight(_text_:search in 4649) [ClassicSimilarity], result of:
        0.041640874 = score(doc=4649,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.230407 = fieldWeight in 4649, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.046875 = fieldNorm(doc=4649)
      0.04226988 = weight(_text_:22 in 4649) [ClassicSimilarity], result of:
        0.04226988 = score(doc=4649,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.23214069 = fieldWeight in 4649, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=4649)
  0.5 = coord(1/2)

Date

26.12.2011 13:40:22

0.041850545 = product of:
  0.08370109 = sum of:
    0.08370109 = sum of:
      0.055521168 = weight(_text_:search in 1634) [ClassicSimilarity], result of:
        0.055521168 = score(doc=1634,freq=8.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.30720934 = fieldWeight in 1634, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.03125 = fieldNorm(doc=1634)
      0.028179923 = weight(_text_:22 in 1634) [ClassicSimilarity], result of:
        0.028179923 = score(doc=1634,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.15476047 = fieldWeight in 1634, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03125 = fieldNorm(doc=1634)
  0.5 = coord(1/2)

Abstract

Purpose - Ontologies are prone to wide semantic variability due to subjective points of view of their composers. The purpose of this paper is to propose a new approach for maximal unification of diverse ontologies for controversial domains by their relations. Design/methodology/approach - Effective matching or unification of multiple ontologies for a specific domain is crucial for the success of many semantic web applications, such as semantic information retrieval and organization, document tagging, summarization and search. To this end, numerous automatic and semi-automatic techniques were proposed in the past decade that attempt to identify similar entities, mostly classes, in diverse ontologies for similar domains. Apparently, matching individual entities cannot result in full integration of ontologies' semantics without matching their inter-relations with all other-related classes (and instances). However, semantic matching of ontological relations still constitutes a major research challenge. Therefore, in this paper the authors propose a new paradigm for assessment of maximal possible matching and unification of ontological relations. To this end, several unification rules for ontological relations were devised based on ontological reference rules, and lexical and textual entailment. These rules were semi-automatically implemented to extend a given ontology with semantically matching relations from another ontology for a similar domain. Then, the ontologies were unified through these similar pairs of relations. The authors observe that these rules can be also facilitated to reveal the contradictory relations in different ontologies. Findings - To assess the feasibility of the approach two experiments were conducted with different sets of multiple personal ontologies on controversial domains constructed by trained subjects. The results for about 50 distinct ontology pairs demonstrate a good potential of the methodology for increasing inter-ontology agreement. Furthermore, the authors show that the presented methodology can lead to a complete unification of multiple semantically heterogeneous ontologies. Research limitations/implications - This is a conceptual study that presents a new approach for semantic unification of ontologies by a devised set of rules along with the initial experimental evidence of its feasibility and effectiveness. However, this methodology has to be fully automatically implemented and tested on a larger dataset in future research. Practical implications - This result has implication for semantic search, since a richer ontology, comprised of multiple aspects and viewpoints of the domain of knowledge, enhances discoverability and improves search results. Originality/value - To the best of the knowledge, this is the first study to examine and assess the maximal level of semantic relation-based ontology unification.

Date

20. 1.2015 18:30:22

Series

Special issue: Semantic search

0.03847164 = product of:
  0.07694328 = sum of:
    0.07694328 = sum of:
      0.0420724 = weight(_text_:search in 1155) [ClassicSimilarity], result of:
        0.0420724 = score(doc=1155,freq=6.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.23279473 = fieldWeight in 1155, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.02734375 = fieldNorm(doc=1155)
      0.034870878 = weight(_text_:22 in 1155) [ClassicSimilarity], result of:
        0.034870878 = score(doc=1155,freq=4.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.19150631 = fieldWeight in 1155, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.02734375 = fieldNorm(doc=1155)
  0.5 = coord(1/2)

Abstract

All the papers underwent a thorough and rigorous peer-review process. The review and selection this year was highly competitive and only papers containing significant research results, innovative methods, or novel and best practices were accepted for publication. Only 29 of 89 submissions were accepted as full papers, representing 32.5% of the total number of submissions. Additional contributions covering noteworthy and important results in special tracks or project reports were accepted, totaling 42 accepted contributions. This year's conference included two outstanding keynote speakers. Dr. Stefan Gradmann, a professor arts department of KU Leuven (Belgium) and director of university library, addressed semantic research drawing from his work with Europeana. The title of his presentation was, "Towards a Semantic Research Library: Digital Humanities Research, Europeana and the Linked Data Paradigm". Dr. Michail Salampasis, associate professor from our conference host institution, the Department of Informatics of the Alexander TEI of Thessaloniki, presented new potential, intersecting search and linked data. The title of his talk was, "Rethinking the Search Experience: What Could Professional Search Systems Do Better?"

Date

17.12.2013 12:51:22

0.03371966 = product of:
  0.06743932 = sum of:
    0.06743932 = sum of:
      0.039259393 = weight(_text_:search in 1626) [ClassicSimilarity], result of:
        0.039259393 = score(doc=1626,freq=4.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.21722981 = fieldWeight in 1626, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.03125 = fieldNorm(doc=1626)
      0.028179923 = weight(_text_:22 in 1626) [ClassicSimilarity], result of:
        0.028179923 = score(doc=1626,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.15476047 = fieldWeight in 1626, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03125 = fieldNorm(doc=1626)
  0.5 = coord(1/2)

Abstract

Purpose - The growing volumes of semantic data available in the web result in the need for handling the information overload phenomenon. The potential of this amount of data is enormous but in most cases it is very difficult for users to visualize, explore and use this data, especially for lay-users without experience with Semantic Web technologies. The paper aims to discuss these issues. Design/methodology/approach - The Visual Information-Seeking Mantra "Overview first, zoom and filter, then details-on-demand" proposed by Shneiderman describes how data should be presented in different stages to achieve an effective exploration. The overview is the first user task when dealing with a data set. The objective is that the user is capable of getting an idea about the overall structure of the data set. Different information architecture (IA) components supporting the overview tasks have been developed, so they are automatically generated from semantic data, and evaluated with end-users. Findings - The chosen IA components are well known to web users, as they are present in most web pages: navigation bars, site maps and site indexes. The authors complement them with Treemaps, a visualization technique for displaying hierarchical data. These components have been developed following an iterative User-Centered Design methodology. Evaluations with end-users have shown that they get easily used to them despite the fact that they are generated automatically from structured data, without requiring knowledge about the underlying semantic technologies, and that the different overview components complement each other as they focus on different information search needs. Originality/value - Obtaining semantic data sets overviews cannot be easily done with the current semantic web browsers. Overviews become difficult to achieve with large heterogeneous data sets, which is typical in the Semantic Web, because traditional IA techniques do not easily scale to large data sets. There is little or no support to obtain overview information quickly and easily at the beginning of the exploration of a new data set. This can be a serious limitation when exploring a data set for the first time, especially for lay-users. The proposal is to reuse and adapt existing IA components to provide this overview to users and show that they can be generated automatically from the thesaurus and ontologies that structure semantic data while providing a comparable user experience to traditional web sites.

Date

20. 1.2015 18:30:22

Series

Special issue: Semantic search

0.032603197 = product of:
  0.06520639 = sum of:
    0.06520639 = sum of:
      0.03470073 = weight(_text_:search in 150) [ClassicSimilarity], result of:
        0.03470073 = score(doc=150,freq=8.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.19200584 = fieldWeight in 150, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.01953125 = fieldNorm(doc=150)
      0.030505663 = weight(_text_:22 in 150) [ClassicSimilarity], result of:
        0.030505663 = score(doc=150,freq=6.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.16753313 = fieldWeight in 150, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.01953125 = fieldNorm(doc=150)
  0.5 = coord(1/2)

Classification

006.7 22

Date

7. 3.2007 19:30:22

DDC

006.7 22

Footnote

Rez. in: JASIST 58(2007) no.3, S.457-458 (A.M.A. Ahmad): "The concept of the semantic web has emerged because search engines and text-based searching are no longer adequate, as these approaches involve an extensive information retrieval process. The deployed searching and retrieving descriptors arc naturally subjective and their deployment is often restricted to the specific application domain for which the descriptors were configured. The new era of information technology imposes different kinds of requirements and challenges. Automatic extracted audiovisual features are required, as these features are more objective, domain-independent, and more native to audiovisual content. This book is a useful guide for researchers, experts, students, and practitioners; it is a very valuable reference and can lead them through their exploration and research in multimedia content and the semantic web. The book is well organized, and introduces the concept of the semantic web and multimedia content analysis to the reader through a logical sequence from standards and hypotheses through system examples, presenting relevant tools and methods. But in some chapters readers will need a good technical background to understand some of the details. Readers may attain sufficient knowledge here to start projects or research related to the book's theme; recent results and articles related to the active research area of integrating multimedia with semantic web technologies are included. This book includes full descriptions of approaches to specific problem domains such as content search, indexing, and retrieval. This book will be very useful to researchers in the multimedia content analysis field who wish to explore the benefits of emerging semantic web technologies in applying multimedia content approaches. The first part of the book covers the definition of the two basic terms multimedia content and semantic web. The Moving Picture Experts Group standards MPEG7 and MPEG21 are quoted extensively. In addition, the means of multimedia content description are elaborated upon and schematically drawn. This extensive description is introduced by authors who are actively involved in those standards and have been participating in the work of the International Organization for Standardization (ISO)/MPEG for many years. On the other hand, this results in bias against the ad hoc or nonstandard tools for multimedia description in favor of the standard approaches. This is a general book for multimedia content; more emphasis on the general multimedia description and extraction could be provided.
The final part of the book discusses research in multimedia content management systems and the semantic web, and presents examples and applications for semantic multimedia analysis in search and retrieval systems. These chapters describe example systems in which current projects have been implemented, and include extensive results and real demonstrations. For example, real case scenarios such as ECommerce medical applications and Web services have been introduced. Topics in natural language, speech and image processing techniques and their application for multimedia indexing, and content-based retrieval have been elaborated upon with extensive examples and deployment methods. The editors of the book themselves provide the readers with a chapter about their latest research results on knowledge-based multimedia content indexing and retrieval. Some interesting applications for multimedia content and the semantic web are introduced. Applications that have taken advantage of the metadata provided by MPEG7 in order to realize advance-access services for multimedia content have been provided. The applications discussed in the third part of the book provide useful guidance to researchers and practitioners properly planning to implement semantic multimedia analysis techniques in new research and development projects in both academia and industry. A fourth part should be added to this book: performance measurements for integrated approaches of multimedia analysis and the semantic web. Performance of the semantic approach is a very sophisticated issue and requires extensive elaboration and effort. Measuring the semantic search is an ongoing research area; several chapters concerning performance measurement and analysis would be required to adequately cover this area and introduce it to readers."

0.032133326 = product of:
  0.06426665 = sum of:
    0.06426665 = product of:
      0.1285333 = sum of:
        0.1285333 = weight(_text_:search in 59) [ClassicSimilarity], result of:
          0.1285333 = score(doc=59,freq=14.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.71119964 = fieldWeight in 59, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0546875 = fieldNorm(doc=59)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Many Semantic Web applications provide access to their resources through text-based search queries, using explicit semantics to improve the search results. This paper provides an analysis of the current state of the art in semantic search, based on 35 existing systems. We identify different types of semantic search features that are used during query construction, the core search process, the presentation of the search results and user feedback on query and results. For each of these, we consider the functionality that the system provides and how this is made available through the user interface.

0.029444544 = product of:
  0.058889087 = sum of:
    0.058889087 = product of:
      0.117778175 = sum of:
        0.117778175 = weight(_text_:search in 4802) [ClassicSimilarity], result of:
          0.117778175 = score(doc=4802,freq=16.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6516894 = fieldWeight in 4802, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=4802)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The power of search is with no doubt one of the main aspects for the success of the Web. Currently available search engines on the Web allow to return results with a high precision. Nevertheless, if we limit our attention only to lookup search we are missing another important search task. In exploratory search, the user is willing not only to find documents relevant with respect to her query but she is also interested in learning, discovering and understanding novel knowledge on complex and sometimes unknown topics. In the paper we address this issue presenting LED, a web based system that aims to improve (lookup) Web search by enabling users to properly explore knowledge associated to her query. We rely on DBpedia to explore the semantics of keywords within the query thus suggesting potentially interesting related topics/keywords to the user.

0.027760584 = product of:
  0.055521168 = sum of:
    0.055521168 = product of:
      0.111042336 = sum of:
        0.111042336 = weight(_text_:search in 411) [ClassicSimilarity], result of:
          0.111042336 = score(doc=411,freq=32.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6144187 = fieldWeight in 411, product of:
              5.656854 = tf(freq=32.0), with freq of:
                32.0 = termFreq=32.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.03125 = fieldNorm(doc=411)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The Web has become the world's largest database, with search being the main tool that allows organizations and individuals to exploit its huge amount of information. Search on the Web has been traditionally based on textual and structural similarities, ignoring to a large degree the semantic dimension, i.e., understanding the meaning of the query and of the document content. Combining search and semantics gives birth to the idea of semantic search. Traditional search engines have already advertised some semantic dimensions. Some of them, for instance, can enhance their generated result sets with documents that are semantically related to the query terms even though they may not include these terms. Nevertheless, the exploitation of the semantic search has not yet reached its full potential. In this book, Roberto De Virgilio, Francesco Guerra and Yannis Velegrakis present an extensive overview of the work done in Semantic Search and other related areas. They explore different technologies and solutions in depth, making their collection a valuable and stimulating reading for both academic and industrial researchers. The book is divided into three parts. The first introduces the readers to the basic notions of the Web of Data. It describes the different kinds of data that exist, their topology, and their storing and indexing techniques. The second part is dedicated to Web Search. It presents different types of search, like the exploratory or the path-oriented, alongside methods for their efficient and effective implementation. Other related topics included in this part are the use of uncertainty in query answering, the exploitation of ontologies, and the use of semantics in mashup design and operation. The focus of the third part is on linked data, and more specifically, on applying ideas originating in recommender systems on linked data management, and on techniques for the efficiently querying answering on linked data.

Content

Inhalt: Introduction.- Part I Introduction to Web of Data.- Topology of the Web of Data.- Storing and Indexing Massive RDF Data Sets.- Designing Exploratory Search Applications upon Web Data Sources.- Part II Search over the Web.- Path-oriented Keyword Search query over RDF.- Interactive Query Construction for Keyword Search on the SemanticWeb.- Understanding the Semantics of Keyword Queries on Relational DataWithout Accessing the Instance.- Keyword-Based Search over Semantic Data.- Semantic Link Discovery over Relational Data.- Embracing Uncertainty in Entity Linking.- The Return of the Entity-Relationship Model: Ontological Query Answering.- Linked Data Services and Semantics-enabled Mashup.- Part III Linked Data Search engines.- A Recommender System for Linked Data.- Flint: from Web Pages to Probabilistic Semantic Data.- Searching and Browsing Linked Data with SWSE.

0.027528752 = product of:
  0.055057503 = sum of:
    0.055057503 = product of:
      0.1651725 = sum of:
        0.1651725 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
          0.1651725 = score(doc=701,freq=2.0), product of:
            0.4408377 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051997773 = queryNorm
            0.3746787 = fieldWeight in 701, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=701)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Content

Vgl.: http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F1627&ei=tAtYUYrBNoHKtQb3l4GYBw&usg=AFQjCNHeaxKkKU3-u54LWxMNYGXaaDLCGw&sig2=8WykXWQoDKjDSdGtAakH2Q&bvm=bv.44442042,d.Yms.

0.026025547 = product of:
  0.052051093 = sum of:
    0.052051093 = product of:
      0.10410219 = sum of:
        0.10410219 = weight(_text_:search in 2069) [ClassicSimilarity], result of:
          0.10410219 = score(doc=2069,freq=18.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.5760175 = fieldWeight in 2069, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2069)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The semantic web not only contains resources but also includes the heterogeneous relationships among them, which is sharply distinguished from the current web. As the growth of the semantic web, specialized search techniques are of significance. In this paper, we present RSS-a framework for enabling ranked semantic search on the semantic web. In this framework, the heterogeneity of relationships is fully exploited to determine the global importance of resources. In addition, the search results can be greatly expanded with entities most semantically related to the query, thus able to provide users with properly ordered semantic search results by combining global ranking values and the relevance between the resources and the query. The proposed semantic search model which supports inference is very different from traditional keyword-based search methods. Moreover, RSS also distinguishes from many current methods of accessing the semantic web data in that it applies novel ranking strategies to prevent returning search results in disorder. The experimental results show that the framework is feasible and can produce better ordering of semantic search results than directly applying the standard PageRank algorithm on the semantic web.

0.024657432 = product of:
  0.049314864 = sum of:
    0.049314864 = product of:
      0.09862973 = sum of:
        0.09862973 = weight(_text_:22 in 4643) [ClassicSimilarity], result of:
          0.09862973 = score(doc=4643,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.5416616 = fieldWeight in 4643, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=4643)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 9.2007 15:41:14

0.024537122 = product of:
  0.049074244 = sum of:
    0.049074244 = product of:
      0.09814849 = sum of:
        0.09814849 = weight(_text_:search in 410) [ClassicSimilarity], result of:
          0.09814849 = score(doc=410,freq=16.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.54307455 = fieldWeight in 410, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0390625 = fieldNorm(doc=410)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Web search engines such as Google, Yahoo! MSN/Bing, and Ask are far from the consummate Web search solution: they do not typically produce direct answers to queries but instead typically recommend a selection of related documents from the Web. We note that in more recent years, search engines have begun to provide direct answers to prose queries matching certain common templates-for example, "population of china" or "12 euro in dollars"-but again, such functionality is limited to a small subset of popular user queries. Furthermore, search engines now provide individual and focused search interfaces over images, videos, locations, news articles, books, research papers, blogs, and real-time social media-although these tools are inarguably powerful, they are limited to their respective domains. In the general case, search engines are not suitable for complex information gathering tasks requiring aggregation from multiple indexed documents: for such tasks, users must manually aggregate tidbits of pertinent information from various pages. In effect, such limitations are predicated on the lack of machine-interpretable structure in HTML-documents, which is often limited to generic markup tags mainly concerned with document renderign and linking. Most of the real content is contained in prose text which is inherently difficult for machines to interpret.

Object

Semantic Web Search Engine

Source

Semantic search over the Web. Eds.: R. De Virgilio, et al

0.024537122 = product of:
  0.049074244 = sum of:
    0.049074244 = product of:
      0.09814849 = sum of:
        0.09814849 = weight(_text_:search in 438) [ClassicSimilarity], result of:
          0.09814849 = score(doc=438,freq=16.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.54307455 = fieldWeight in 438, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0390625 = fieldNorm(doc=438)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

In this paper, we discuss the architecture and implementation of the Semantic Web Search Engine (SWSE). Following traditional search engine architecture, SWSE consists of crawling, data enhancing, indexing and a user interface for search, browsing and retrieval of information; unlike traditional search engines, SWSE operates over RDF Web data - loosely also known as Linked Data - which implies unique challenges for the system design, architecture, algorithms, implementation and user interface. In particular, many challenges exist in adopting Semantic Web technologies for Web data: the unique challenges of the Web - in terms of scale, unreliability, inconsistency and noise - are largely overlooked by the current Semantic Web standards. Herein, we describe the current SWSE system, initially detailing the architecture and later elaborating upon the function, design, implementation and performance of each individual component. In so doing, we also give an insight into how current Semantic Web standards can be tailored, in a best-effort manner, for use on Web data. Throughout, we offer evaluation and complementary argumentation to support our design choices, and also offer discussion on future directions and open research questions. Later, we also provide candid discussion relating to the difficulties currently faced in bringing such a search engine into the mainstream, and lessons learnt from roughly six years working on the Semantic Web Search Engine project.

Object

Semantic Web Search Engine

0.024290511 = product of:
  0.048581023 = sum of:
    0.048581023 = product of:
      0.097162046 = sum of:
        0.097162046 = weight(_text_:search in 717) [ClassicSimilarity], result of:
          0.097162046 = score(doc=717,freq=8.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.5376164 = fieldWeight in 717, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0546875 = fieldNorm(doc=717)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

In the final presentation of the afternoon, Jeroen Wester of Aduna described the main features of their open-source, facet-driven enterprise search solution, AutoFocus. AutoFocus is based upon and exploits the advantages of Semantic Web technologies, in particular RDF (Resource Description Framework), although a bewildering variety of related technologies - XML, SOAP, SKOS, OWL - are also employed. In addition to providing components for metadata-based data integration and cross-silo search and navigation in a single enterprise search solution, AutoFocus offers the advantage of being open-source, meaning that its source code is freely available for customization

0.02113494 = product of:
  0.04226988 = sum of:
    0.04226988 = product of:
      0.08453976 = sum of:
        0.08453976 = weight(_text_:22 in 6048) [ClassicSimilarity], result of:
          0.08453976 = score(doc=6048,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.46428138 = fieldWeight in 6048, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=6048)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 9.2007 15:41:14

0.02113494 = product of:
  0.04226988 = sum of:
    0.04226988 = product of:
      0.08453976 = sum of:
        0.08453976 = weight(_text_:22 in 100) [ClassicSimilarity], result of:
          0.08453976 = score(doc=100,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.46428138 = fieldWeight in 100, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=100)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 9.2007 15:41:14

0.020820437 = product of:
  0.041640874 = sum of:
    0.041640874 = product of:
      0.08328175 = sum of:
        0.08328175 = weight(_text_:search in 1638) [ClassicSimilarity], result of:
          0.08328175 = score(doc=1638,freq=8.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.460814 = fieldWeight in 1638, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=1638)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The Web of Data keeps growing rapidly. However, the full exploitation of this large amount of structured data faces numerous challenges like usability, scalability, imprecise information needs and data change. We present Semplore, an IR-based system that aims at addressing these issues. Semplore supports intuitive faceted search and complex queries both on text and structured data. It combines imprecise keyword search and precise structured query in a unified ranking scheme. Scalable query processing is supported by leveraging inverted indexes traditionally used in IR systems. This is combined with a novel block-based index structure to support efficient index update when data changes. The experimental results show that Semplore is an efficient and effective system for searching the Web of Data and can be used as a basic infrastructure for Web-scale Semantic Web search engines.

0.020820437 = product of:
  0.041640874 = sum of:
    0.041640874 = product of:
      0.08328175 = sum of:
        0.08328175 = weight(_text_:search in 3295) [ClassicSimilarity], result of:
          0.08328175 = score(doc=3295,freq=2.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.460814 = fieldWeight in 3295, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.09375 = fieldNorm(doc=3295)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Ein Schwerpunkt der Online Information 2004 bildete das Thema "Search": Wie wird die Suche in 2005 aussehen? Welche Bedeutung haben Taxonomien? Wie verändern sich Suchfunktionen?