Search (10 results, page 1 of 1)

0.0151896225 = product of:
  0.106327355 = sum of:
    0.106327355 = weight(_text_:sites in 437) [ClassicSimilarity], result of:
      0.106327355 = score(doc=437,freq=6.0), product of:
        0.21257097 = queryWeight, product of:
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.04066292 = queryNorm
        0.500197 = fieldWeight in 437, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.0390625 = fieldNorm(doc=437)
  0.14285715 = coord(1/7)

Abstract

The Web is a surprisingly extensive source of information: it offers a huge number of sites containing data about a disparate range of topics. Although Web pages are built for human fruition, not for automatic processing of the data, we observe that an increasing number of Web sites deliver pages containing structured information about recognizable concepts, relevant to specific application domains, such as movies, finance, sport, products, etc. The development of scalable techniques to discover, extract, and integrate data from fairly structured large corpora available on the Web is a challenging issue, because to face the Web scale, these activities should be accomplished automatically by domain-independent techniques. To cope with the complexity and the heterogeneity of Web data, state-of-the-art approaches focus on information organized according to specific patterns that frequently occur on the Web. Meaningful examples are WebTables, which focuses on data published in HTML tables, and information extraction systems, such as TextRunner, which exploits lexical-syntactic patterns. As noticed by Cafarella et al., even if a small fraction of the Web is organized according to these patterns, due to the Web scale, the amount of data involved is impressive. In this chapter, we focus on methods and techniques to wring out value from the data delivered by large data-intensive Web sites.

0.014031572 = product of:
  0.098221004 = sum of:
    0.098221004 = weight(_text_:sites in 425) [ClassicSimilarity], result of:
      0.098221004 = score(doc=425,freq=8.0), product of:
        0.21257097 = queryWeight, product of:
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.04066292 = queryNorm
        0.46206218 = fieldWeight in 425, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.03125 = fieldNorm(doc=425)
  0.14285715 = coord(1/7)

Abstract

The degree of structure of Web content is the determining factor for the types of functionality that search engines can provide. The more well structured the Web content is, the easier it is for search engines to understand Web content and provide advanced functionality, such as faceted filtering or the aggregation of content from multiple Web sites, based on this understanding. Today, most Web sites are generated from structured data that is stored in relational databases. Thus, it does not require too much extra effort for Web sites to publish this structured data directly on the Web in addition to HTML pages, and thus help search engines to understand Web content and provide improved functionality. An early approach to realize this idea and help search engines to understand Web content is Microformats, a technique for markingup structured data about specific types on entities-such as tags, blog posts, people, or reviews-within HTML pages. As Microformats are focused on a few entity types, the World Wide Web Consortium (W3C) started in 2004 to standardize RDFa as an alternative, more generic language for embedding any type of data into HTML pages. Today, major search engines such as Google, Yahoo, and Bing extract Microformat and RDFa data describing products, reviews, persons, events, and recipes from Web pages and use the extracted data to improve the user's search experience. The search engines have started to aggregate structured data from different Web sites and augment their search results with these aggregated information units in the form of rich snippets which combine, for instance, data This chapter gives an overview of the topology of the Web of Data that has been created by publishing data on the Web using the microformats RDFa, Microdata and Linked Data publishing techniques.

0.008769733 = product of:
  0.061388128 = sum of:
    0.061388128 = weight(_text_:sites in 432) [ClassicSimilarity], result of:
      0.061388128 = score(doc=432,freq=2.0), product of:
        0.21257097 = queryWeight, product of:
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.04066292 = queryNorm
        0.28878886 = fieldWeight in 432, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.227637 = idf(docFreq=644, maxDocs=44218)
          0.0390625 = fieldNorm(doc=432)
  0.14285715 = coord(1/7)

Abstract

For a long while, the creation of Web content required at least basic knowledge of Web technologies, meaning that for many Web users, the Web was de facto a read-only medium. This changed with the arrival of the "social Web," when Web applications started to allow users to publish Web content without technological expertise. Here, content creation is often an inclusive, iterative, and interactive process. Examples of social Web applications include blogs, social networking sites, as well as many specialized applications, for example, for saving and sharing bookmarks and publishing photos. Social semantic Web applications are social Web applications in which knowledge is expressed not only in the form of text and multimedia but also through informal to formal annotations that describe, reflect, and enhance the content. These annotations often take the shape of RDF graphs backed by ontologies, but less formal annotations such as free-form tags or tags from a controlled vocabulary may also be available. Wikis are one example of social Web applications for collecting and sharing knowledge. They allow users to easily create and edit documents, so-called wiki pages, using a Web browser. The pages in a wiki are often heavily interlinked, which makes it easy to find related information and browse the content.

0.0027546322 = product of:
  0.019282425 = sum of:
    0.019282425 = product of:
      0.03856485 = sum of:
        0.03856485 = weight(_text_:22 in 3283) [ClassicSimilarity], result of:
          0.03856485 = score(doc=3283,freq=2.0), product of:
            0.14239462 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04066292 = queryNorm
            0.2708308 = fieldWeight in 3283, 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=3283)
      0.5 = coord(1/2)
  0.14285715 = coord(1/7)

0.0025662337 = product of:
  0.017963635 = sum of:
    0.017963635 = product of:
      0.03592727 = sum of:
        0.03592727 = weight(_text_:design in 4725) [ClassicSimilarity], result of:
          0.03592727 = score(doc=4725,freq=4.0), product of:
            0.15288728 = queryWeight, product of:
              3.7598698 = idf(docFreq=2798, maxDocs=44218)
              0.04066292 = queryNorm
            0.23499186 = fieldWeight in 4725, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.7598698 = idf(docFreq=2798, maxDocs=44218)
              0.03125 = fieldNorm(doc=4725)
      0.5 = coord(1/2)
  0.14285715 = coord(1/7)

Content

Inhalt: Introduction - Principles ofLinked Data - The Web ofData - Linked Data Design Considerations - Linked Data Design Considerations - Consuming Linked Data - Summary and Outlook Vgl.: http://linkeddatabook.com/book.

0.0023611132 = product of:
  0.016527792 = sum of:
    0.016527792 = product of:
      0.033055585 = sum of:
        0.033055585 = weight(_text_:22 in 3197) [ClassicSimilarity], result of:
          0.033055585 = score(doc=3197,freq=2.0), product of:
            0.14239462 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04066292 = queryNorm
            0.23214069 = fieldWeight in 3197, 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=3197)
      0.5 = coord(1/2)
  0.14285715 = coord(1/7)

Date

24. 8.2016 14:03:22

0.0022682515 = product of:
  0.01587776 = sum of:
    0.01587776 = product of:
      0.03175552 = sum of:
        0.03175552 = weight(_text_:design in 434) [ClassicSimilarity], result of:
          0.03175552 = score(doc=434,freq=2.0), product of:
            0.15288728 = queryWeight, product of:
              3.7598698 = idf(docFreq=2798, maxDocs=44218)
              0.04066292 = queryNorm
            0.20770542 = fieldWeight in 434, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7598698 = idf(docFreq=2798, maxDocs=44218)
              0.0390625 = fieldNorm(doc=434)
      0.5 = coord(1/2)
  0.14285715 = coord(1/7)

Abstract

The Entity-Relationship (ER) model is a fundamental formalism for conceptual modeling in database design; it was introduced by Chen in his milestone paper, and it is now widely used, being flexible and easily understood by practitioners. With the rise of the Semantic Web, conceptual modeling formalisms have gained importance again as ontology formalisms, in the Semantic Web parlance. Ontologies and conceptual models are aimed at representing, rather than the structure of data, the domain of interest, that is, the fragment of the real world that is being represented by the data and the schema. A prominent formalism for modeling ontologies are Description Logics (DLs), which are decidable fragments of first-order logic, particularly suitable for ontological modeling and querying. In particular, DL ontologies are sets of assertions describing sets of objects and (usually binary) relations among such sets, exactly in the same fashion as the ER model. Recently, research on DLs has been focusing on the problem of answering queries under ontologies, that is, given a query q, an instance B, and an ontology X, answering q under B and amounts to compute the answers that are logically entailed from B by using the assertions of X. In this context, where data size is usually large, a central issue the data complexity of query answering, i.e., the computational complexity with respect to the data set B only, while the ontology X and the query q are fixed.

0.0022682515 = product of:
  0.01587776 = sum of:
    0.01587776 = product of:
      0.03175552 = sum of:
        0.03175552 = weight(_text_:design in 2552) [ClassicSimilarity], result of:
          0.03175552 = score(doc=2552,freq=2.0), product of:
            0.15288728 = queryWeight, product of:
              3.7598698 = idf(docFreq=2798, maxDocs=44218)
              0.04066292 = queryNorm
            0.20770542 = fieldWeight in 2552, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7598698 = idf(docFreq=2798, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2552)
      0.5 = coord(1/2)
  0.14285715 = coord(1/7)

Abstract

This collection of research papers provides extensive information on deploying services, concepts, and approaches for using open linked data from libraries and other cultural heritage institutions. With a special emphasis on how libraries and other cultural heritage institutions can create effective end user interfaces using open, linked data or other datasets. These papers are essential reading for any one interesting in user interface design or the semantic web.

0.0019478193 = product of:
  0.013634734 = sum of:
    0.013634734 = product of:
      0.027269468 = sum of:
        0.027269468 = weight(_text_:22 in 1155) [ClassicSimilarity], result of:
          0.027269468 = score(doc=1155,freq=4.0), product of:
            0.14239462 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04066292 = 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)
  0.14285715 = coord(1/7)

Date

17.12.2013 12:51:22

0.0018146011 = product of:
  0.012702207 = sum of:
    0.012702207 = product of:
      0.025404414 = sum of:
        0.025404414 = weight(_text_:design in 411) [ClassicSimilarity], result of:
          0.025404414 = score(doc=411,freq=2.0), product of:
            0.15288728 = queryWeight, product of:
              3.7598698 = idf(docFreq=2798, maxDocs=44218)
              0.04066292 = queryNorm
            0.16616434 = fieldWeight in 411, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7598698 = idf(docFreq=2798, maxDocs=44218)
              0.03125 = fieldNorm(doc=411)
      0.5 = coord(1/2)
  0.14285715 = coord(1/7)

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.