Search (15 results, page 1 of 1)

0.055799447 = product of:
  0.14879853 = sum of:
    0.027619982 = weight(_text_:world in 79) [ClassicSimilarity], result of:
      0.027619982 = score(doc=79,freq=2.0), product of:
        0.16259687 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.042302497 = queryNorm
        0.16986786 = fieldWeight in 79, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.03125 = fieldNorm(doc=79)
    0.03670178 = weight(_text_:wide in 79) [ClassicSimilarity], result of:
      0.03670178 = score(doc=79,freq=2.0), product of:
        0.18743214 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042302497 = queryNorm
        0.1958137 = fieldWeight in 79, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.03125 = fieldNorm(doc=79)
    0.08447677 = weight(_text_:web in 79) [ClassicSimilarity], result of:
      0.08447677 = score(doc=79,freq=36.0), product of:
        0.13805464 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042302497 = queryNorm
        0.6119082 = fieldWeight in 79, product of:
          6.0 = tf(freq=36.0), with freq of:
            36.0 = termFreq=36.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=79)
  0.375 = coord(3/8)

Abstract

With the terrific growth of data volume and data being produced every second on millions of devices across the globe, there is a desperate need to manage the unstructured data available on web pages efficiently. Semantic Web or also known as Web of Trust structures the scattered data on the Internet according to the needs of the user. It is an extension of the World Wide Web (WWW) which focuses on manipulating web data on behalf of Humans. Due to the ability of the Semantic Web to integrate data from disparate sources and hence makes it more user-friendly, it is an emerging trend. Tim Berners-Lee first introduced the term Semantic Web and since then it has come a long way to become a more intelligent and intuitive web. Data Visualization plays an essential role in explaining complex concepts in a universal manner through pictorial representation, and the Semantic Web helps in broadening the potential of Data Visualization and thus making it an appropriate combination. The objective of this chapter is to provide fundamental insights concerning the semantic web technologies and in addition to that it also elucidates the issues as well as the solutions regarding the semantic web. The purpose of this chapter is to highlight the semantic web architecture in detail while also comparing it with the traditional search system. It classifies the semantic web architecture into three major pillars i.e. RDF, Ontology, and XML. Moreover, it describes different semantic web tools used in the framework and technology. It attempts to illustrate different approaches of the semantic web search engines. Besides stating numerous challenges faced by the semantic web it also illustrates the solutions.

Theme

Semantic Web

0.051901706 = product of:
  0.083042726 = sum of:
    0.017262489 = weight(_text_:world in 1211) [ClassicSimilarity], result of:
      0.017262489 = score(doc=1211,freq=2.0), product of:
        0.16259687 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.042302497 = queryNorm
        0.10616741 = fieldWeight in 1211, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.01953125 = fieldNorm(doc=1211)
    0.022938613 = weight(_text_:wide in 1211) [ClassicSimilarity], result of:
      0.022938613 = score(doc=1211,freq=2.0), product of:
        0.18743214 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042302497 = queryNorm
        0.122383565 = fieldWeight in 1211, 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=1211)
    0.012444603 = weight(_text_:web in 1211) [ClassicSimilarity], result of:
      0.012444603 = score(doc=1211,freq=2.0), product of:
        0.13805464 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042302497 = queryNorm
        0.09014259 = fieldWeight in 1211, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.01953125 = fieldNorm(doc=1211)
    0.015276998 = weight(_text_:information in 1211) [ClassicSimilarity], result of:
      0.015276998 = score(doc=1211,freq=36.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.20572007 = fieldWeight in 1211, product of:
          6.0 = tf(freq=36.0), with freq of:
            36.0 = termFreq=36.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.01953125 = fieldNorm(doc=1211)
    0.01512002 = product of:
      0.03024004 = sum of:
        0.03024004 = weight(_text_:retrieval in 1211) [ClassicSimilarity], result of:
          0.03024004 = score(doc=1211,freq=16.0), product of:
            0.12796146 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.042302497 = queryNorm
            0.23632148 = fieldWeight in 1211, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.01953125 = fieldNorm(doc=1211)
      0.5 = coord(1/2)
  0.625 = coord(5/8)

Abstract

In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary generation algorithm to generate a set of concepts for the digital library and a technique called the max-min distance technique to cluster them. Additionally, the concepts were visualized in a spring embedding graph layout to depict the semantic relationship among them. The resulting graph layout serves as an aid to users for retrieving documents. An online archive containing the contents of D-Lib Magazine from July 1995 to May 2002 was used to test the utility of an implemented retrieval and visualization system. We believe that the method developed and tested can be applied to many different domains to help users get a better understanding of online document collections and to minimize users' cognitive load during execution of search tasks. Over the past few years, the volume of information available through the World Wide Web has been expanding exponentially. Never has so much information been so readily available and shared among so many people. Unfortunately, the unstructured nature and huge volume of information accessible over networks have made it hard for users to sift through and find relevant information. To deal with this problem, information retrieval (IR) techniques have gained more intensive attention from both industrial and academic researchers. Numerous IR techniques have been developed to help deal with the information overload problem. These techniques concentrate on mathematical models and algorithms for retrieval. Popular IR models such as the Boolean model, the vector-space model, the probabilistic model and their variants are well established.
From the user's perspective, however, it is still difficult to use current information retrieval systems. Users frequently have problems expressing their information needs and translating those needs into queries. This is partly due to the fact that information needs cannot be expressed appropriately in systems terms. It is not unusual for users to input search terms that are different from the index terms information systems use. Various methods have been proposed to help users choose search terms and articulate queries. One widely used approach is to incorporate into the information system a thesaurus-like component that represents both the important concepts in a particular subject area and the semantic relationships among those concepts. Unfortunately, the development and use of thesauri is not without its own problems. The thesaurus employed in a specific information system has often been developed for a general subject area and needs significant enhancement to be tailored to the information system where it is to be used. This thesaurus development process, if done manually, is both time consuming and labor intensive. Usage of a thesaurus in searching is complex and may raise barriers for the user. For illustration purposes, let us consider two scenarios of thesaurus usage. In the first scenario the user inputs a search term and the thesaurus then displays a matching set of related terms. Without an overview of the thesaurus - and without the ability to see the matching terms in the context of other terms - it may be difficult to assess the quality of the related terms in order to select the correct term. In the second scenario the user browses the whole thesaurus, which is organized as in an alphabetically ordered list. The problem with this approach is that the list may be long, and neither does it show users the global semantic relationship among all the listed terms.
Nevertheless, because thesaurus use has shown to improve retrieval, for our method we integrate functions in the search interface that permit users to explore built-in search vocabularies to improve retrieval from digital libraries. Our method automatically generates the terms and their semantic relationships representing relevant topics covered in a digital library. We call these generated terms the "concepts", and the generated terms and their semantic relationships we call the "concept space". Additionally, we used a visualization technique to display the concept space and allow users to interact with this space. The automatically generated term set is considered to be more representative of subject area in a corpus than an "externally" imposed thesaurus, and our method has the potential of saving a significant amount of time and labor for those who have been manually creating thesauri as well. Information visualization is an emerging discipline and developed very quickly in the last decade. With growing volumes of documents and associated complexities, information visualization has become increasingly important. Researchers have found information visualization to be an effective way to use and understand information while minimizing a user's cognitive load. Our work was based on an algorithmic approach of concept discovery and association. Concepts are discovered using an algorithm based on an automated thesaurus generation procedure. Subsequently, similarities among terms are computed using the cosine measure, and the associations among terms are established using a method known as max-min distance clustering. The concept space is then visualized in a spring embedding graph, which roughly shows the semantic relationships among concepts in a 2-D visual representation. The semantic space of the visualization is used as a medium for users to retrieve the desired documents. In the remainder of this article, we present our algorithmic approach of concept generation and clustering, followed by description of the visualization technique and interactive interface. The paper ends with key conclusions and discussions on future work.

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.040229395 = product of:
  0.08045879 = sum of:
    0.020714985 = weight(_text_:world in 1197) [ClassicSimilarity], result of:
      0.020714985 = score(doc=1197,freq=2.0), product of:
        0.16259687 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.042302497 = queryNorm
        0.12740089 = fieldWeight in 1197, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1197)
    0.027526336 = weight(_text_:wide in 1197) [ClassicSimilarity], result of:
      0.027526336 = score(doc=1197,freq=2.0), product of:
        0.18743214 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042302497 = queryNorm
        0.14686027 = fieldWeight in 1197, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1197)
    0.014933523 = weight(_text_:web in 1197) [ClassicSimilarity], result of:
      0.014933523 = score(doc=1197,freq=2.0), product of:
        0.13805464 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042302497 = queryNorm
        0.108171105 = fieldWeight in 1197, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1197)
    0.01728395 = weight(_text_:information in 1197) [ClassicSimilarity], result of:
      0.01728395 = score(doc=1197,freq=32.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.23274569 = fieldWeight in 1197, product of:
          5.656854 = tf(freq=32.0), with freq of:
            32.0 = termFreq=32.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1197)
  0.5 = coord(4/8)

Abstract

User interfaces for digital information discovery often require users to click around and read a lot of text in order to find the text they want to read-a process that is often frustrating and tedious. This is exacerbated because of the limited amount of text that can be displayed on a computer screen. To improve the user experience of computer mediated information discovery, information visualization techniques are applied to the digital library context, while retaining traditional information organization concepts. In this article, the "virtual (book) spine" and the virtual spine viewer are introduced. The virtual spine viewer is an application which allows users to visually explore large information spaces or collections while also allowing users to hone in on individual resources of interest. The virtual spine viewer introduced here is an alpha prototype, presented to promote discussion and further work. Information discovery changed radically with the introduction of computerized library access catalogs, the World Wide Web and its search engines, and online bookstores. Yet few instances of these technologies provide a user experience analogous to walking among well-organized, well-stocked bookshelves-which many people find useful as well as pleasurable. To put it another way, many of us have heard or voiced complaints about the paucity of "online browsing"-but what does this really mean? In traditional information spaces such as libraries, often we can move freely among the books and other resources. When we walk among organized, labeled bookshelves, we get a sense of the information space-we take in clues, perhaps unconsciously, as to the scope of the collection, the currency of resources, the frequency of their use, etc. We also enjoy unexpected discoveries such as finding an interesting resource because library staff deliberately located it near similar resources, or because it was miss-shelved, or because we saw it on a bookshelf on the way to the water fountain.
When our experience of information discovery is mediated by a computer, we neither move ourselves nor the monitor. We have only the computer's monitor to view, and the keyboard and/or mouse to manipulate what is displayed there. Computer interfaces often reduce our ability to get a sense of the contents of a library: we don't perceive the scope of the library: its breadth, (the quantity of materials/information), its density (how full the shelves are, how thorough the collection is for individual topics), or the general audience for the materials (e.g., whether the materials are appropriate for middle school students, college professors, etc.). Additionally, many computer interfaces for information discovery require users to scroll through long lists, to click numerous navigational links and to read a lot of text to find the exact text they want to read. Text features of resources are almost always presented alphabetically, and the number of items in these alphabetical lists sometimes can be very long. Alphabetical ordering is certainly an improvement over no ordering, but it generally has no bearing on features with an inherent non-alphabetical ordering (e.g., dates of historical events), nor does it necessarily group similar items together. Alphabetical ordering of resources is analogous to one of the most familiar complaints about dictionaries: sometimes you need to know how to spell a word in order to look up its correct spelling in the dictionary. Some have used technology to replicate the appearance of physical libraries, presenting rooms of bookcases and shelves of book spines in virtual 3D environments. This approach presents a problem, as few book spines can be displayed legibly on a monitor screen. This article examines the role of book spines, call numbers, and other traditional organizational and information discovery concepts, and integrates this knowledge with information visualization techniques to show how computers and monitors can meet or exceed similar information discovery methods. The goal is to tap the unique potentials of current information visualization approaches in order to improve information discovery, offer new services, and most important of all, improve user satisfaction. We need to capitalize on what computers do well while bearing in mind their limitations. The intent is to design GUIs to optimize utility and provide a positive experience for the user.

0.012888186 = product of:
  0.051552743 = sum of:
    0.022864517 = weight(_text_:information in 919) [ClassicSimilarity], result of:
      0.022864517 = score(doc=919,freq=14.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.3078936 = fieldWeight in 919, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=919)
    0.028688224 = product of:
      0.057376448 = sum of:
        0.057376448 = weight(_text_:retrieval in 919) [ClassicSimilarity], result of:
          0.057376448 = score(doc=919,freq=10.0), product of:
            0.12796146 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.042302497 = queryNorm
            0.44838852 = fieldWeight in 919, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=919)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Abstract

Document retrieval is a highly interactive process dealing with large amounts of information. Visual representations can provide both a means for managing the complexity of large information structures and an interface style well suited to interactive manipulation. The system we have designed utilizes visually displayed graphic structures and a direct manipulation interface style to supply an integrated environment for retrieval. A common visually displayed network structure is used for query, document content, and term relations. A query can be modified through direct manipulation of its visual form by incorporating terms from any other information structure the system displays. An associative thesaurus of terms and an inter-document network provide information about a document collection that can complement other retrieval aids. Visualization of these large data structures makes use of fisheye views and overview diagrams to help overcome some of the inherent difficulties of orientation and navigation in large information structures.

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.0080227135 = product of:
  0.032090854 = sum of:
    0.024889207 = weight(_text_:web in 4837) [ClassicSimilarity], result of:
      0.024889207 = score(doc=4837,freq=2.0), product of:
        0.13805464 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042302497 = queryNorm
        0.18028519 = fieldWeight in 4837, 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=4837)
    0.007201646 = weight(_text_:information in 4837) [ClassicSimilarity], result of:
      0.007201646 = score(doc=4837,freq=2.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.09697737 = fieldWeight in 4837, 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=4837)
  0.25 = coord(2/8)

Abstract

Icon system could represent an efficient solution for collective iconic categorization of knowledge by providing graphical interpretation. Their pictorial characters assist visualizing the structure of text to become more understandable beyond vocabulary obstacle. In this paper we are proposing a Knowledge Engineering (KM) based iconic representation approach. We assume that these systematic icons improve collective knowledge management. Meanwhile, text (constructed under our knowledge management model - Hypertopic) helps to reduce the diversity of graphical understanding belonging to different users. This "position paper" also prepares to demonstrate our hypothesis by an "iconic social tagging" experiment which is to be accomplished in 2011 with UTT students. We describe the "socio semantic web" information portal involved in this project, and a part of the icons already designed for this experiment in Sustainability field. We have reviewed existing theoretical works on icons from various origins, which can be used to lay the foundation of robust "icons systems".

0.005734653 = product of:
  0.045877226 = sum of:
    0.045877226 = weight(_text_:wide in 3888) [ClassicSimilarity], result of:
      0.045877226 = score(doc=3888,freq=2.0), product of:
        0.18743214 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042302497 = queryNorm
        0.24476713 = fieldWeight in 3888, 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=3888)
  0.125 = coord(1/8)

Abstract

We present a new technique called "t-SNE" that visualizes high-dimensional data by giving each datapoint a location in a two or three-dimensional map. The technique is a variation of Stochastic Neighbor Embedding (Hinton and Roweis, 2002) that is much easier to optimize, and produces significantly better visualizations by reducing the tendency to crowd points together in the center of the map. t-SNE is better than existing techniques at creating a single map that reveals structure at many different scales. This is particularly important for high-dimensional data that lie on several different, but related, low-dimensional manifolds, such as images of objects from multiple classes seen from multiple viewpoints. For visualizing the structure of very large data sets, we show how t-SNE can use random walks on neighborhood graphs to allow the implicit structure of all of the data to influence the way in which a subset of the data is displayed. We illustrate the performance of t-SNE on a wide variety of data sets and compare it with many other non-parametric visualization techniques, including Sammon mapping, Isomap, and Locally Linear Embedding. The visualizations produced by t-SNE are significantly better than those produced by the other techniques on almost all of the data sets.

0.0044732788 = product of:
  0.017893115 = sum of:
    0.007201646 = weight(_text_:information in 548) [ClassicSimilarity], result of:
      0.007201646 = score(doc=548,freq=2.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.09697737 = fieldWeight in 548, 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=548)
    0.01069147 = product of:
      0.02138294 = sum of:
        0.02138294 = weight(_text_:retrieval in 548) [ClassicSimilarity], result of:
          0.02138294 = score(doc=548,freq=2.0), product of:
            0.12796146 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.042302497 = queryNorm
            0.16710453 = fieldWeight in 548, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=548)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Abstract

UDC aims to be a consistent and complete classification system, that enables practitioners to classify documents swiftly and smoothly. The eventual goal of UDC is to enable the public at large to retrieve documents from large collections of documents that are classified with UDC. The large size of the UDC Master Reference File, MRF with over 66.000 records, makes it difficult to obtain an overview and to understand its structure. Moreover, finding the right classification in MRF turns out to be difficult in practice. Last but not least, retrieval of documents requires insight and understanding of the coding system. Visualization is an effective means to support the development of UDC as well as its use by practitioners. Moreover, visualization offers possibilities to use the classification without use of the coding system as such. MagnaView has developed an application which demonstrates the use of interactive visualization to face these challenges. In our presentation, we discuss these challenges, and we give a demonstration of the way the application helps face these. Examples of visualizations can be found below.

Content

Beitrag anlässlich des 'UDC Seminar: Information Access for the Global Community, The Hague, 4-5 June 2007'. - Vgl.: http://www.udcc.org/seminar07/presentations/magnaview.pdf.

0.0044732788 = product of:
  0.017893115 = sum of:
    0.007201646 = weight(_text_:information in 3366) [ClassicSimilarity], result of:
      0.007201646 = score(doc=3366,freq=2.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.09697737 = fieldWeight in 3366, 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=3366)
    0.01069147 = product of:
      0.02138294 = sum of:
        0.02138294 = weight(_text_:retrieval in 3366) [ClassicSimilarity], result of:
          0.02138294 = score(doc=3366,freq=2.0), product of:
            0.12796146 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.042302497 = queryNorm
            0.16710453 = fieldWeight in 3366, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3366)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Abstract

Documents in rich text corpora usually contain multiple facets of information. For example, an article about a specific disease often consists of different facets such as symptom, treatment, cause, diagnosis, prognosis, and prevention. Thus, documents may have different relations based on different facets. Powerful search tools have been developed to help users locate lists of individual documents that are most related to specific keywords. However, there is a lack of effective analysis tools that reveal the multifaceted relations of documents within or cross the document clusters. In this paper, we present FacetAtlas, a multifaceted visualization technique for visually analyzing rich text corpora. FacetAtlas combines search technology with advanced visual analytical tools to convey both global and local patterns simultaneously. We describe several unique aspects of FacetAtlas, including (1) node cliques and multifaceted edges, (2) an optimized density map, and (3) automated opacity pattern enhancement for highlighting visual patterns, (4) interactive context switch between facets. In addition, we demonstrate the power of FacetAtlas through a case study that targets patient education in the health care domain. Our evaluation shows the benefits of this work, especially in support of complex multifaceted data analysis.

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.0037333807 = product of:
  0.029867046 = sum of:
    0.029867046 = weight(_text_:web in 2906) [ClassicSimilarity], result of:
      0.029867046 = score(doc=2906,freq=2.0), product of:
        0.13805464 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042302497 = queryNorm
        0.21634221 = fieldWeight in 2906, 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=2906)
  0.125 = coord(1/8)

Abstract

The use of research impact metrics and analytics has become an integral component to many aspects of institutional assessment. Many platforms currently exist to provide such analytics, both proprietary and open source; however, the functionality of these systems may not always overlap to serve uniquely specific needs. In this paper, I describe a novel web-based platform, named Manifold, that I built to serve custom research impact assessment needs in the University of Minnesota Medical School. Built on a standard LAMP architecture, Manifold automatically pulls publication data for faculty from Scopus through APIs, calculates impact metrics through automated analytics, and dynamically generates report-like profiles that visualize those metrics. Work on this project has resulted in many lessons learned about challenges to sustainability and scalability in developing a system of such magnitude.

0.0037333807 = product of:
  0.029867046 = sum of:
    0.029867046 = weight(_text_:web in 3205) [ClassicSimilarity], result of:
      0.029867046 = score(doc=3205,freq=2.0), product of:
        0.13805464 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042302497 = queryNorm
        0.21634221 = fieldWeight in 3205, 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=3205)
  0.125 = coord(1/8)

Abstract

The goal of Open Knowledge Maps is to create a visual interface to the world's scientific knowledge. The base for this visual interface consists of so-called knowledge maps, which enable the exploration of existing knowledge and the discovery of new knowledge. Our open source knowledge mapping software applies a mixture of summarization techniques and similarity measures on article metadata, which are iteratively chained together. After processing, the representation is saved in a database for use in a web visualization. In the future, we want to create a space for collective knowledge mapping that brings together individuals and communities involved in exploration and discovery. We want to enable people to guide each other in their discovery by collaboratively annotating and modifying the automatically created maps.

0.0032295235 = product of:
  0.012918094 = sum of:
    0.0043209875 = weight(_text_:information in 3035) [ClassicSimilarity], result of:
      0.0043209875 = score(doc=3035,freq=2.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.058186423 = fieldWeight in 3035, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0234375 = fieldNorm(doc=3035)
    0.008597107 = product of:
      0.017194213 = sum of:
        0.017194213 = weight(_text_:22 in 3035) [ClassicSimilarity], result of:
          0.017194213 = score(doc=3035,freq=2.0), product of:
            0.14813614 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042302497 = queryNorm
            0.116070345 = fieldWeight in 3035, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0234375 = fieldNorm(doc=3035)
      0.5 = coord(1/2)
  0.25 = coord(2/8)

Content

As the team describe in a paper posted (http://arxiv.org/abs/1605.04951) on arXiv, they found that figures did indeed matter-but not all in the same way. An average paper in PubMed Central has about one diagram for every three pages and gets 1.67 citations. Papers with more diagrams per page and, to a lesser extent, plots per page tended to be more influential (on average, a paper accrued two more citations for every extra diagram per page, and one more for every extra plot per page). By contrast, including photographs and equations seemed to decrease the chances of a paper being cited by others. That agrees with a study from 2012, whose authors counted (by hand) the number of mathematical expressions in over 600 biology papers and found that each additional equation per page reduced the number of citations a paper received by 22%. This does not mean that researchers should rush to include more diagrams in their next paper. Dr Howe has not shown what is behind the effect, which may merely be one of correlation, rather than causation. It could, for example, be that papers with lots of diagrams tend to be those that illustrate new concepts, and thus start a whole new field of inquiry. Such papers will certainly be cited a lot. On the other hand, the presence of equations really might reduce citations. Biologists (as are most of those who write and read the papers in PubMed Central) are notoriously mathsaverse. If that is the case, looking in a physics archive would probably produce a different result.
Dr Howe and his colleagues do, however, believe that the study of diagrams can result in new insights. A figure showing new metabolic pathways in a cell, for example, may summarise hundreds of experiments. Since illustrations can convey important scientific concepts in this way, they think that browsing through related figures from different papers may help researchers come up with new theories. As Dr Howe puts it, "the unit of scientific currency is closer to the figure than to the paper." With this thought in mind, the team have created a website (viziometrics.org (http://viziometrics.org/) ) where the millions of images sorted by their program can be searched using key words. Their next plan is to extract the information from particular types of scientific figure, to create comprehensive "super" figures: a giant network of all the known chemical processes in a cell for example, or the best-available tree of life. At just one such superfigure per paper, though, the citation records of articles containing such all-embracing diagrams may very well undermine the correlation that prompted their creation in the first place. Call it the ultimate marriage of chart and science.

0.0013888627 = product of:
  0.011110902 = sum of:
    0.011110902 = product of:
      0.022221804 = sum of:
        0.022221804 = weight(_text_:retrieval in 1202) [ClassicSimilarity], result of:
          0.022221804 = score(doc=1202,freq=6.0), product of:
            0.12796146 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.042302497 = queryNorm
            0.17366013 = fieldWeight in 1202, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0234375 = fieldNorm(doc=1202)
      0.5 = coord(1/2)
  0.125 = coord(1/8)

Abstract

The concept of c-space is proposed as a visualization schema relating containers of content to cataloging surrogates and classification structures. Possible applications of keyword vector clusters within c-space could include improved retrieval rates through the use of captioning within visual hierarchies, tracings of semantic bleeding among subclasses, and access to buried knowledge within subject-neutral publication containers. The Scholastica Project is described as one example, following a tradition of research dating back to the 1980's. Preliminary focus group assessment indicates that this type of classification rendering may offer digital library searchers enriched entry strategies and an expanded range of re-entry vocabularies. Those of us who work in traditional libraries typically assume that our systems of classification: Library of Congress Classification (LCC) and Dewey Decimal Classification (DDC), are descriptive rather than prescriptive. In other words, LCC classes and subclasses approximate natural groupings of texts that reflect an underlying order of knowledge, rather than arbitrary categories prescribed by librarians to facilitate efficient shelving. Philosophical support for this assumption has traditionally been found in a number of places, from the archetypal tree of knowledge, to Aristotelian categories, to the concept of discursive formations proposed by Michel Foucault. Gary P. Radford has elegantly described an encounter with Foucault's discursive formations in the traditional library setting: "Just by looking at the titles on the spines, you can see how the books cluster together...You can identify those books that seem to form the heart of the discursive formation and those books that reside on the margins. Moving along the shelves, you see those books that tend to bleed over into other classifications and that straddle multiple discursive formations. You can physically and sensually experience...those points that feel like state borders or national boundaries, those points where one subject ends and another begins, or those magical places where one subject has morphed into another..."
But what happens to this awareness in a digital library? Can discursive formations be represented in cyberspace, perhaps through diagrams in a visualization interface? And would such a schema be helpful to a digital library user? To approach this question, it is worth taking a moment to reconsider what Radford is looking at. First, he looks at titles to see how the books cluster. To illustrate, I scanned one hundred books on the shelves of a college library under subclass HT 101-395, defined by the LCC subclass caption as Urban groups. The City. Urban sociology. Of the first 100 titles in this sequence, fifty included the word "urban" or variants (e.g. "urbanization"). Another thirty-five used the word "city" or variants. These keywords appear to mark their titles as the heart of this discursive formation. The scattering of titles not using "urban" or "city" used related terms such as "town," "community," or in one case "skyscrapers." So we immediately see some empirical correlation between keywords and classification. But we also see a problem with the commonly used search technique of title-keyword. A student interested in urban studies will want to know about this entire subclass, and may wish to browse every title available therein. A title-keyword search on "urban" will retrieve only half of the titles, while a search on "city" will retrieve just over a third. There will be no overlap, since no titles in this sample contain both words. The only place where both words appear in a common string is in the LCC subclass caption, but captions are not typically indexed in library Online Public Access Catalogs (OPACs). In a traditional library, this problem is mitigated when the student goes to the shelf looking for any one of the books and suddenly discovers a much wider selection than the keyword search had led him to expect. But in a digital library, the issue of non-retrieval can be more problematic, as studies have indicated. Micco and Popp reported that, in a study funded partly by the U.S. Department of Education, 65 of 73 unskilled users searching for material on U.S./Soviet foreign relations found some material but never realized they had missed a large percentage of what was in the database.

Theme

Klassifikationssysteme im Online-Retrieval

0.0010802469 = product of:
  0.008641975 = sum of:
    0.008641975 = weight(_text_:information in 3067) [ClassicSimilarity], result of:
      0.008641975 = score(doc=3067,freq=2.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.116372846 = fieldWeight in 3067, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3067)
  0.125 = coord(1/8)

Source

Young information scientists. 1(2016), S.31-43

9.0020575E-4 = product of:
  0.007201646 = sum of:
    0.007201646 = weight(_text_:information in 3869) [ClassicSimilarity], result of:
      0.007201646 = score(doc=3869,freq=2.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.09697737 = fieldWeight in 3869, 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=3869)
  0.125 = coord(1/8)

Abstract

The changes in KO systems induced by sociocultural influences may include those in both classificatory principles and cultural features. The proposed study will examine the Korean Decimal Classification (KDC)'s adaptation of the Dewey Decimal Classification (DDC) by comparing the two systems. This case manifests the sociocultural influences on KOSs in a cross-cultural context. Therefore, the study aims at an in-depth investigation of sociocultural influences by situating a KOS in a cross-cultural environment and examining the dynamics between two classification systems designed to organize information resources in two distinct sociocultural contexts. As a preceding stage of the comparison, the analysis was conducted on the changes that result from the meeting of different sociocultural feature in a descriptive method. The analysis aims to identify variations between the two schemes in comparison of the knowledge structures of the two classifications, in terms of the quantity of class numbers that represent concepts and their relationships in each of the individual main classes. The most effective analytic strategy to show the patterns of the comparison was visualizations of similarities and differences between the two systems. Increasing or decreasing tendencies in the class through various editions were analyzed. Comparing the compositions of the main classes and distributions of concepts in the KDC and DDC discloses the differences in their knowledge structures empirically. This phase of quantitative analysis and visualizing techniques generates empirical evidence leading to interpretation.

7.201646E-4 = product of:
  0.005761317 = sum of:
    0.005761317 = weight(_text_:information in 2547) [ClassicSimilarity], result of:
      0.005761317 = score(doc=2547,freq=2.0), product of:
        0.0742611 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.042302497 = queryNorm
        0.0775819 = fieldWeight in 2547, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=2547)
  0.125 = coord(1/8)

Abstract

The discovery service (a search engine and service called WILBERT) used at our library at the Technical University of Applied Sciences Wildau (TUAS Wildau) is comprised of more than 8 million items. If we were to record all licensed publications in this tool to a higher level of articles, including their bibliographic records and full texts, we would have a holding estimated at a hundred million documents. A lot of features, such as ranking, autocompletion, multi-faceted classification, refining opportunities reduce the number of hits. However, it is not enough to give intuitive support for a systematic overview of topics related to documents in the library. John Naisbitt once said: "We are drowning in information, but starving for knowledge." This quote is still very true today. Two years ago, we started to develop micro thesauri for MINT topics in order to develop an advanced indexing of the library stock. We use iQvoc as a vocabulary management system to create the thesaurus. It provides an easy-to-use browser interface that builds a SKOS thesaurus in the background. The purpose of this is to integrate the thesauri in WILBERT in order to offer a better subject-related search. This approach especially supports first-year students by giving them the possibility to browse through a hierarchical alignment of a subject, for instance, logistics or computer science, and thereby discover how the terms are related. It also supports the students with an insight into established abbreviations and alternative labels. Students at the TUAS Wildau were involved in the developmental process of the software regarding the interface and functionality of iQvoc. The first steps have been taken and involve the inclusion of 3000 terms in our discovery tool WILBERT.