Search (8 results, page 1 of 1)

0.29900423 = product of:
  0.68343824 = sum of:
    0.04156021 = product of:
      0.12468062 = sum of:
        0.12468062 = weight(_text_:3a in 4388) [ClassicSimilarity], result of:
          0.12468062 = score(doc=4388,freq=2.0), product of:
            0.26621342 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.031400457 = queryNorm
            0.46834838 = fieldWeight in 4388, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4388)
      0.33333334 = coord(1/3)
    0.018474855 = weight(_text_:web in 4388) [ClassicSimilarity], result of:
      0.018474855 = score(doc=4388,freq=2.0), product of:
        0.10247572 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.031400457 = queryNorm
        0.18028519 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
    0.12468062 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
      0.12468062 = score(doc=4388,freq=2.0), product of:
        0.26621342 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.031400457 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
    0.12468062 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
      0.12468062 = score(doc=4388,freq=2.0), product of:
        0.26621342 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.031400457 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
    0.12468062 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
      0.12468062 = score(doc=4388,freq=2.0), product of:
        0.26621342 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.031400457 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
    0.12468062 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
      0.12468062 = score(doc=4388,freq=2.0), product of:
        0.26621342 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.031400457 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
    0.12468062 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
      0.12468062 = score(doc=4388,freq=2.0), product of:
        0.26621342 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.031400457 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
  0.4375 = coord(7/16)

Footnote

Vgl. unter: https://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&ved=2ahUKEwizweHljdbcAhVS16QKHXcFD9QQFjABegQICRAB&url=https%3A%2F%2Fwww.researchgate.net%2Fpublication%2F271200105_Die_Autonomie_des_Menschen_und_der_Maschine_-_gegenwartige_Definitionen_von_Autonomie_zwischen_philosophischem_Hintergrund_und_technologischer_Umsetzbarkeit_Redigierte_Version_der_Magisterarbeit_Karls&usg=AOvVaw06orrdJmFF2xbCCp_hL26q.

0.018819518 = product of:
  0.100370765 = sum of:
    0.056416538 = weight(_text_:benutzer in 479) [ClassicSimilarity], result of:
      0.056416538 = score(doc=479,freq=2.0), product of:
        0.17907447 = queryWeight, product of:
          5.7029257 = idf(docFreq=400, maxDocs=44218)
          0.031400457 = queryNorm
        0.31504512 = fieldWeight in 479, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.7029257 = idf(docFreq=400, maxDocs=44218)
          0.0390625 = fieldNorm(doc=479)
    0.005345665 = weight(_text_:information in 479) [ClassicSimilarity], result of:
      0.005345665 = score(doc=479,freq=2.0), product of:
        0.055122808 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.031400457 = queryNorm
        0.09697737 = fieldWeight in 479, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=479)
    0.038608566 = weight(_text_:software in 479) [ClassicSimilarity], result of:
      0.038608566 = score(doc=479,freq=4.0), product of:
        0.124570385 = queryWeight, product of:
          3.9671519 = idf(docFreq=2274, maxDocs=44218)
          0.031400457 = queryNorm
        0.30993375 = fieldWeight in 479, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.9671519 = idf(docFreq=2274, maxDocs=44218)
          0.0390625 = fieldNorm(doc=479)
  0.1875 = coord(3/16)

Abstract

Gegenstand dieser Arbeit ist die Entwicklung eines funktionalen Prototyps einer Webanwendung für die Verknüpfung der Evaluierung von explorativen Suchen in Verbindung mit der Durchführung klassisches Retrievaltests. Als Grundlage für die Programmierung des Prototyps werden benutzerorientierte und systemorientierte Evalulierungsmethoden für Suchmaschinen analysiert und in einem theoretischen Modell zur Untersuchung von Informationssysteme und Suchmaschinen kombiniert. Bei der Gestaltung des Modells und des Prototyps wird gezeigt, wie sich aufgezeichnete Aktionsdaten praktisch für die Suchmaschinenevaluierung verwenden lassen, um auf der einen Seite eine Datengrundlage für Retrievaltests zu gewinnen und andererseits, um für die Auswertung von Relevanzbewertungen auch das implizierte Feedback durch Handlungen der Anwender zu berücksichtigen. Retrievaltests sind das gängige und erprobte Mittel zur Messung der Retrievaleffektiviät von Informationssystemen und Suchmaschinen, verzichten aber auf eine Berücksichtigung des tatsächlichen Nutzerverhaltens. Eine Methode für die Erfassung der Interaktionen von Suchmaschinennutzern sind protokollbasierte Tests, mit denen sich Logdateien über Benutzer einer Anwendung generieren lassen. Die im Rahmen der Arbeit umgesetzte Software bietet einen Ansatz, Retrievaltests auf Basis protokollierter Nutzerdaten in Verbindung mit kontrollierten Suchaufgaben, durchzuführen. Das Ergebnis dieser Arbeit ist ein fertiger funktionaler Prototyp, der in seinem Umfang bereits innerhalb von Suchmaschinenstudien nutzbar ist.

Imprint

Hamburg : HAW, Department Information

0.018194698 = product of:
  0.09703839 = sum of:
    0.03405392 = weight(_text_:wide in 1210) [ClassicSimilarity], result of:
      0.03405392 = score(doc=1210,freq=2.0), product of:
        0.13912784 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.031400457 = queryNorm
        0.24476713 = fieldWeight in 1210, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1210)
    0.05542456 = weight(_text_:web in 1210) [ClassicSimilarity], result of:
      0.05542456 = score(doc=1210,freq=18.0), product of:
        0.10247572 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.031400457 = queryNorm
        0.5408555 = fieldWeight in 1210, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1210)
    0.007559912 = weight(_text_:information in 1210) [ClassicSimilarity], result of:
      0.007559912 = score(doc=1210,freq=4.0), product of:
        0.055122808 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.031400457 = queryNorm
        0.13714671 = fieldWeight in 1210, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1210)
  0.1875 = coord(3/16)

Abstract

The current web consists of documents that are highly heterogeneous and hard for machines to understand. The Semantic Web is a progressive movement of the Word Wide Web, aiming at converting the current web of unstructured documents to the web of data. In the Semantic Web, web documents are annotated with metadata using standardized ontology language. These annotated documents are directly processable by machines and it highly improves their usability and usefulness. In Ericsson, similar problems occur. There are massive documents being created with well-defined structures. Though these documents are about domain specific knowledge and can have rich relations, they are currently managed by a traditional search engine, which ignores the rich domain specific information and presents few data to users. Motivated by the Semantic Web, we aim to find standard ways to process these documents, extract rich domain specific information and annotate these data to documents with formal markup languages. We propose this project to develop a domain specific search engine for processing different documents and building explicit relations for them. This research project consists of the three main focuses: examining different domain specific documents and finding ways to extract their metadata; integrating a text search engine with an ontology server; exploring novel ways to build relations for documents. We implement this system and demonstrate its functions. As a prototype, the system provides required features and will be extended in the future.

Theme

Semantic Web

0.017246107 = product of:
  0.06898443 = sum of:
    0.01702696 = weight(_text_:wide in 4232) [ClassicSimilarity], result of:
      0.01702696 = score(doc=4232,freq=2.0), product of:
        0.13912784 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.031400457 = queryNorm
        0.122383565 = fieldWeight in 4232, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.01953125 = fieldNorm(doc=4232)
    0.03694971 = weight(_text_:web in 4232) [ClassicSimilarity], result of:
      0.03694971 = score(doc=4232,freq=32.0), product of:
        0.10247572 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.031400457 = queryNorm
        0.36057037 = fieldWeight in 4232, product of:
          5.656854 = tf(freq=32.0), with freq of:
            32.0 = termFreq=32.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.01953125 = fieldNorm(doc=4232)
    0.0070716497 = weight(_text_:information in 4232) [ClassicSimilarity], result of:
      0.0070716497 = score(doc=4232,freq=14.0), product of:
        0.055122808 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.031400457 = queryNorm
        0.128289 = fieldWeight in 4232, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.01953125 = fieldNorm(doc=4232)
    0.007936104 = weight(_text_:retrieval in 4232) [ClassicSimilarity], result of:
      0.007936104 = score(doc=4232,freq=2.0), product of:
        0.09498371 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.031400457 = queryNorm
        0.08355226 = fieldWeight in 4232, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.01953125 = fieldNorm(doc=4232)
  0.25 = coord(4/16)

Abstract

After the launch of the World Wide Web, it became clear that searching documentson the Web would not be trivial. Well-known engines to search the web, like Google, focus on search in web documents using keywords. The documents are structured and indexed to ensure keywords match documents as accurately as possible. However, searching by keywords does not always suice. It is oen the case that users do not know exactly how to formulate the search query or which keywords guarantee retrieving the most relevant documents. Besides that, it occurs that users rather want to browse information than looking up something specific. It turned out that there is need for systems that enable more interactivity and facilitate the gradual refinement of search queries to explore the Web. Users expect more from the Web because the short keyword-based queries they pose during search, do not suffice for all cases. On top of that, the Web is changing structurally. The Web comprises, apart from a collection of documents, more and more linked data, pieces of information structured so they can be processed by machines. The consequently applied semantics allow users to exactly indicate machines their search intentions. This is made possible by describing data following controlled vocabularies, concept lists composed by experts, published uniquely identifiable on the Web. Even so, it is still not trivial to explore data on the Web. There is a large variety of vocabularies and various data sources use different terms to identify the same concepts.
This PhD-thesis describes how to effectively explore linked data on the Web. The main focus is on scenarios where users want to discover relationships between resources rather than finding out more about something specific. Searching for a specific document or piece of information fits in the theoretical framework of information retrieval and is associated with exploratory search. Exploratory search goes beyond 'looking up something' when users are seeking more detailed understanding, further investigation or navigation of the initial search results. The ideas behind exploratory search and querying linked data merge when it comes to the way knowledge is represented and indexed by machines - how data is structured and stored for optimal searchability. Queries and information should be aligned to facilitate that searches also reveal connections between results. This implies that they take into account the same semantic entities, relevant at that moment. To realize this, we research three techniques that are evaluated one by one in an experimental set-up to assess how well they succeed in their goals. In the end, the techniques are applied to a practical use case that focuses on forming a bridge between the Web and the use of digital libraries in scientific research. Our first technique focuses on the interactive visualization of search results. Linked data resources can be brought in relation with each other at will. This leads to complex and diverse graphs structures. Our technique facilitates navigation and supports a workflow starting from a broad overview on the data and allows narrowing down until the desired level of detail to then broaden again. To validate the flow, two visualizations where implemented and presented to test-users. The users judged the usability of the visualizations, how the visualizations fit in the workflow and to which degree their features seemed useful for the exploration of linked data.
The ideas behind exploratory search and querying linked data merge when it comes to the way knowledge is represented and indexed by machines - how data is structured and stored for optimal searchability. eries and information should be aligned to facilitate that searches also reveal connections between results. This implies that they take into account the same semantic entities, relevant at that moment. To realize this, we research three techniques that are evaluated one by one in an experimental set-up to assess how well they succeed in their goals. In the end, the techniques are applied to a practical use case that focuses on forming a bridge between the Web and the use of digital libraries in scientific research.
When we speak about finding relationships between resources, it is necessary to dive deeper in the structure. The graph structure of linked data where the semantics give meaning to the relationships between resources enable the execution of pathfinding algorithms. The assigned weights and heuristics are base components of such algorithms and ultimately define (the order) which resources are included in a path. These paths explain indirect connections between resources. Our third technique proposes an algorithm that optimizes the choice of resources in terms of serendipity. Some optimizations guard the consistence of candidate-paths where the coherence of consecutive connections is maximized to avoid trivial and too arbitrary paths. The implementation uses the A* algorithm, the de-facto reference when it comes to heuristically optimized minimal cost paths. The effectiveness of paths was measured based on common automatic metrics and surveys where the users could indicate their preference for paths, generated each time in a different way. Finally, all our techniques are applied to a use case about publications in digital libraries where they are aligned with information about scientific conferences and researchers. The application to this use case is a practical example because the different aspects of exploratory search come together. In fact, the techniques also evolved from the experiences when implementing the use case. Practical details about the semantic model are explained and the implementation of the search system is clarified module by module. The evaluation positions the result, a prototype of a tool to explore scientific publications, researchers and conferences next to some important alternatives.

Theme

Semantic Web

0.013704884 = product of:
  0.073092714 = sum of:
    0.022169823 = weight(_text_:web in 3829) [ClassicSimilarity], result of:
      0.022169823 = score(doc=3829,freq=2.0), product of:
        0.10247572 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.031400457 = queryNorm
        0.21634221 = fieldWeight in 3829, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=3829)
    0.012829596 = weight(_text_:information in 3829) [ClassicSimilarity], result of:
      0.012829596 = score(doc=3829,freq=8.0), product of:
        0.055122808 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.031400457 = queryNorm
        0.23274569 = fieldWeight in 3829, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3829)
    0.0380933 = weight(_text_:retrieval in 3829) [ClassicSimilarity], result of:
      0.0380933 = score(doc=3829,freq=8.0), product of:
        0.09498371 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.031400457 = queryNorm
        0.40105087 = fieldWeight in 3829, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=3829)
  0.1875 = coord(3/16)

Abstract

In this thesis, we present an ontology-based information extraction and retrieval system and its application to soccer domain. In general, we deal with three issues in semantic search, namely, usability, scalability and retrieval performance. We propose a keyword-based semantic retrieval approach. The performance of the system is improved considerably using domain-specific information extraction, inference and rules. Scalability is achieved by adapting a semantic indexing approach. The system is implemented using the state-of-the-art technologies in SemanticWeb and its performance is evaluated against traditional systems as well as the query expansion methods. Furthermore, a detailed evaluation is provided to observe the performance gain due to domain-specific information extraction and inference. Finally, we show how we use semantic indexing to solve simple structural ambiguities.

Source

Information Systems. 37(2012) no. 4, S.294-305

Theme

Semantic Web

0.0045009907 = product of:
  0.036007926 = sum of:
    0.009071894 = weight(_text_:information in 3046) [ClassicSimilarity], result of:
      0.009071894 = score(doc=3046,freq=4.0), product of:
        0.055122808 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.031400457 = queryNorm
        0.16457605 = fieldWeight in 3046, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3046)
    0.02693603 = weight(_text_:retrieval in 3046) [ClassicSimilarity], result of:
      0.02693603 = score(doc=3046,freq=4.0), product of:
        0.09498371 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.031400457 = queryNorm
        0.2835858 = fieldWeight in 3046, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=3046)
  0.125 = coord(2/16)

Abstract

Die wachsende Anzahl an Musik in Form von Audiodateien im Internet und deren Beliebtheit bei Internetnutzern auf der ganzen Welt erfordert praktikable Retrieval-Lösungen. Das Feld des Musik Information Retrievals (MIR) beinhaltet unter anderem die Erarbeitung von Musik Information Retrieval Systemen mit unterschiedlichen, teilweise multimedialen Lösungsansätzen. Die Funktionsweise von MIR-Systemen (= Musiksuchmaschinen), die textbasiert, und solchen, die mit Mustererkennung operieren, wird in dieser Arbeit erläutert. Des Weiteren werden im Sinne eines bewerteten State-of-the-Arts gratis zugängliche Musiksuchmaschinen im WWW betrachtet, die den Bereich Pop/Rock abdecken. Basierend auf diesem State-of-the-Art und auf Zweitbewertungen werden Empfehlungen in Form von Anforderungen an Musiksuchmaschinen formuliert und mögliche Zukunftsszeniaren aufgezeigt.

0.001856564 = product of:
  0.014852512 = sum of:
    0.0037419656 = weight(_text_:information in 1536) [ClassicSimilarity], result of:
      0.0037419656 = score(doc=1536,freq=2.0), product of:
        0.055122808 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.031400457 = queryNorm
        0.06788416 = fieldWeight in 1536, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02734375 = fieldNorm(doc=1536)
    0.011110546 = weight(_text_:retrieval in 1536) [ClassicSimilarity], result of:
      0.011110546 = score(doc=1536,freq=2.0), product of:
        0.09498371 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.031400457 = queryNorm
        0.11697317 = fieldWeight in 1536, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02734375 = fieldNorm(doc=1536)
  0.125 = coord(2/16)

Abstract

Multiword expressions (MWEs) are lexical items that can be decomposed into single words and display lexical, syntactic, semantic, pragmatic and/or statistical idiosyncrasy (Sag et al., 2002; Kim, 2008; Calzolari et al., 2002). The proper treatment of multiword expressions such as rock 'n' roll and make a decision is essential for many natural language processing (NLP) applications like information extraction and retrieval, terminology extraction and machine translation, and it is important to identify multiword expressions in context. For example, in machine translation we must know that MWEs form one semantic unit, hence their parts should not be translated separately. For this, multiword expressions should be identified first in the text to be translated. The chief aim of this thesis is to develop machine learning-based approaches for the automatic detection of different types of multiword expressions in English and Hungarian natural language texts. In our investigations, we pay attention to the characteristics of different types of multiword expressions such as nominal compounds, multiword named entities and light verb constructions, and we apply novel methods to identify MWEs in raw texts. In the thesis it will be demonstrated that nominal compounds and multiword amed entities may require a similar approach for their automatic detection as they behave in the same way from a linguistic point of view. Furthermore, it will be shown that the automatic detection of light verb constructions can be carried out using two effective machine learning-based approaches.

8.964953E-4 = product of:
  0.014343925 = sum of:
    0.014343925 = weight(_text_:information in 3288) [ClassicSimilarity], result of:
      0.014343925 = score(doc=3288,freq=10.0), product of:
        0.055122808 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.031400457 = queryNorm
        0.2602176 = fieldWeight in 3288, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3288)
  0.0625 = coord(1/16)

Abstract

This dissertation investigates the social and technological factors of collaboratively organizing information in commons-based peer production systems. To do so, it analyzes the diverse strategies that members of Wikimedia Foundation (WMF) project communities use to organize information. Key findings from this dissertation show that conceptual structures of information organization are encoded into the infrastructure of WMF projects. The fact that WMF projects are commons-based peer production systems means that we can inspect the code that enables these systems, but a specific type of technical literacy is required to do so. I use three methods in this dissertation. I conduct a qualitative content analysis of the discussions surrounding the design, implementation and evaluation of the category system; a quantitative analysis using descriptive statistics of patterns of editing among editors who contributed to the code of templates for information boxes; and a close reading of the infrastructure used to create the category system, the infobox templates, and the knowledge base of structured data.