Search (146 results, page 1 of 8)

0.061951227 = product of:
  0.123902455 = sum of:
    0.01058955 = weight(_text_:information in 3758) [ClassicSimilarity], result of:
      0.01058955 = score(doc=3758,freq=4.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.13714671 = fieldWeight in 3758, 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=3758)
    0.0764742 = weight(_text_:united in 3758) [ClassicSimilarity], result of:
      0.0764742 = score(doc=3758,freq=2.0), product of:
        0.24675635 = queryWeight, product of:
          5.6101127 = idf(docFreq=439, maxDocs=44218)
          0.043984205 = queryNorm
        0.30991787 = fieldWeight in 3758, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6101127 = idf(docFreq=439, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3758)
    0.03683871 = product of:
      0.07367742 = sum of:
        0.07367742 = weight(_text_:states in 3758) [ClassicSimilarity], result of:
          0.07367742 = score(doc=3758,freq=2.0), product of:
            0.24220218 = queryWeight, product of:
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.043984205 = queryNorm
            0.304198 = fieldWeight in 3758, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3758)
      0.5 = coord(1/2)
  0.5 = coord(3/6)

Abstract

Whereas traditional science maps emphasize citation statistics and static relationships, this paper presents a term-based method to identify and visualize the evolutionary pathways of scientific topics in a series of time slices. First, we create a data preprocessing model for accurate term cleaning, consolidating, and clustering. Then we construct a simulated data streaming function and introduce a learning process to train a relationship identification function to adapt to changing environments in real time, where relationships of topic evolution, fusion, death, and novelty are identified. The main result of the method is a map of scientific evolutionary pathways. The visual routines provide a way to indicate the interactions among scientific subjects and a version in a series of time slices helps further illustrate such evolutionary pathways in detail. The detailed outline offers sufficient statistical information to delve into scientific topics and routines and then helps address meaningful insights with the assistance of expert knowledge. This empirical study focuses on scientific proposals granted by the United States National Science Foundation, and demonstrates the feasibility and reliability. Our method could be widely applied to a range of science, technology, and innovation policy research, and offer insight into the evolutionary pathways of scientific activities.

Source

Journal of the Association for Information Science and Technology. 68(2017) no.8, S.1925-1939

0.056925435 = product of:
  0.11385087 = sum of:
    0.023200544 = weight(_text_:information in 1292) [ClassicSimilarity], result of:
      0.023200544 = score(doc=1292,freq=30.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.3004734 = fieldWeight in 1292, product of:
          5.477226 = tf(freq=30.0), with freq of:
            30.0 = termFreq=30.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=1292)
    0.061179362 = weight(_text_:united in 1292) [ClassicSimilarity], result of:
      0.061179362 = score(doc=1292,freq=2.0), product of:
        0.24675635 = queryWeight, product of:
          5.6101127 = idf(docFreq=439, maxDocs=44218)
          0.043984205 = queryNorm
        0.2479343 = fieldWeight in 1292, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6101127 = idf(docFreq=439, maxDocs=44218)
          0.03125 = fieldNorm(doc=1292)
    0.029470965 = product of:
      0.05894193 = sum of:
        0.05894193 = weight(_text_:states in 1292) [ClassicSimilarity], result of:
          0.05894193 = score(doc=1292,freq=2.0), product of:
            0.24220218 = queryWeight, product of:
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.043984205 = queryNorm
            0.24335839 = fieldWeight in 1292, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.506572 = idf(docFreq=487, maxDocs=44218)
              0.03125 = fieldNorm(doc=1292)
      0.5 = coord(1/2)
  0.5 = coord(3/6)

Abstract

A visual thesaurus system and method for displaying a selected term in association with its one or more meanings, other words to which it is related, and further relationship information. The results of a search are presented in a directed graph that provides more information than an ordered list. When a user selects one of the results, the display reorganizes around the user's search allowing for further searches, without the interruption of going to additional pages.

Content

Traditional print reference guides often have two methods of finding information: an order (alphabetical for dictionaries and encyclopedias, by subject hierarchy in the case of thesauri) and indices (ordered lists, with a more complete listing of words and concepts, which refers back to original content from the main body of the book). A user of such traditional print reference guides who is looking for information will either browse through the ordered information in the main body of the reference book, or scan through the indices to find what is necessary. The advent of the computer allows for much more rapid electronic searches of the same information, and for multiple layers of indices. Users can either search through information by entering a keyword, or users can browse through the information through an outline index, which represents the information contained in the main body of the data. There are two traditional user interfaces for such applications. First, the user may type text into a search field and in response, a list of results is returned to the user. The user then selects a returned entry and may page through the resulting information. Alternatively, the user may choose from a list of words from an index. For example, software thesaurus applications, in which a user attempts to find synonyms, antonyms, homonyms, etc. for a selected word, are usually implemented using the conventional search and presentation techniques discussed above. The presentation of results only allows for a one-dimensional order of data at any one time. In addition, only a limited number of results can be shown at once, and selecting a result inevitably leads to another page-if the result is not satisfactory, the users must search again. Finally, it is difficult to present information about the manner in which the search results are related, or to present quantitative information about the results without causing confusion. Therefore, there exists a need for a multidimensional graphical display of information, in particular with respect to information relating to the meaning of words and their relationships to other words. There further exists a need to present large amounts of information in a way that can be manipulated by the user, without the user losing his place. And there exists a need for more fluid, intuitive and powerful thesaurus functionality that invites the exploration of language.

Series

United States Patent 20050171760

0.047723807 = product of:
  0.14317141 = sum of:
    0.012707461 = weight(_text_:information in 3230) [ClassicSimilarity], result of:
      0.012707461 = score(doc=3230,freq=4.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.16457605 = fieldWeight in 3230, 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=3230)
    0.13046396 = weight(_text_:networks in 3230) [ClassicSimilarity], result of:
      0.13046396 = score(doc=3230,freq=8.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.6271047 = fieldWeight in 3230, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.046875 = fieldNorm(doc=3230)
  0.33333334 = coord(2/6)

Abstract

Visualization of scientific results using networks has become popular in scientometric research. We provide base maps for Mendeley reader count data using the publication year 2012 from the Web of Science data. Example networks are shown and explained. The reader can use our base maps to visualize other results with the VOSViewer. The proposed overlay maps are able to show the impact of publications in terms of readership data. The advantage of using our base maps is that it is not necessary for the user to produce a network based on all data (e.g., from 1 year), but can collect the Mendeley data for a single institution (or journals, topics) and can match them with our already produced information. Generation of such large-scale networks is still a demanding task despite the available computer power and digital data availability. Therefore, it is very useful to have base maps and create the network with the overlay technique.

Source

Journal of the Association for Information Science and Technology. 67(2016) no.12, S.3064-3072

0.03992383 = product of:
  0.07984766 = sum of:
    0.01058955 = weight(_text_:information in 5272) [ClassicSimilarity], result of:
      0.01058955 = score(doc=5272,freq=4.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.13714671 = fieldWeight in 5272, 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=5272)
    0.054359984 = weight(_text_:networks in 5272) [ClassicSimilarity], result of:
      0.054359984 = score(doc=5272,freq=2.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.26129362 = fieldWeight in 5272, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5272)
    0.0148981325 = product of:
      0.029796265 = sum of:
        0.029796265 = weight(_text_:22 in 5272) [ClassicSimilarity], result of:
          0.029796265 = score(doc=5272,freq=2.0), product of:
            0.1540252 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043984205 = queryNorm
            0.19345059 = fieldWeight in 5272, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5272)
      0.5 = coord(1/2)
  0.5 = coord(3/6)

Abstract

This article describes the latest development of a generic approach to detecting and visualizing emerging trends and transient patterns in scientific literature. The work makes substantial theoretical and methodological contributions to progressive knowledge domain visualization. A specialty is conceptualized and visualized as a time-variant duality between two fundamental concepts in information science: research fronts and intellectual bases. A research front is defined as an emergent and transient grouping of concepts and underlying research issues. The intellectual base of a research front is its citation and co-citation footprint in scientific literature - an evolving network of scientific publications cited by research-front concepts. Kleinberg's (2002) burst-detection algorithm is adapted to identify emergent research-front concepts. Freeman's (1979) betweenness centrality metric is used to highlight potential pivotal points of paradigm shift over time. Two complementary visualization views are designed and implemented: cluster views and time-zone views. The contributions of the approach are that (a) the nature of an intellectual base is algorithmically and temporally identified by emergent research-front terms, (b) the value of a co-citation cluster is explicitly interpreted in terms of research-front concepts, and (c) visually prominent and algorithmically detected pivotal points substantially reduce the complexity of a visualized network. The modeling and visualization process is implemented in CiteSpace II, a Java application, and applied to the analysis of two research fields: mass extinction (1981-2004) and terrorism (1990-2003). Prominent trends and pivotal points in visualized networks were verified in collaboration with domain experts, who are the authors of pivotal-point articles. Practical implications of the work are discussed. A number of challenges and opportunities for future studies are identified.

Date

22. 7.2006 16:11:05

Source

Journal of the American Society for Information Science and Technology. 57(2006) no.3, S.359-377

0.03992383 = product of:
  0.07984766 = sum of:
    0.01058955 = weight(_text_:information in 4641) [ClassicSimilarity], result of:
      0.01058955 = score(doc=4641,freq=4.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.13714671 = fieldWeight in 4641, 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=4641)
    0.054359984 = weight(_text_:networks in 4641) [ClassicSimilarity], result of:
      0.054359984 = score(doc=4641,freq=2.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.26129362 = fieldWeight in 4641, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4641)
    0.0148981325 = product of:
      0.029796265 = sum of:
        0.029796265 = weight(_text_:22 in 4641) [ClassicSimilarity], result of:
          0.029796265 = score(doc=4641,freq=2.0), product of:
            0.1540252 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043984205 = queryNorm
            0.19345059 = fieldWeight in 4641, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4641)
      0.5 = coord(1/2)
  0.5 = coord(3/6)

Abstract

Studies on the state and structure of digital knowledge concerning science generally relate to macro and meso scales. Supported by visualizations, these studies can deliver knowledge about emerging scientific fields or collaboration between countries, scientific centers, or groups of researchers. Analyses of individual activities or single scientific career paths are rarely presented and discussed. The authors decided to fill this gap and developed a web application for visualizing the scientific output of particular researchers. This free software based on bibliographic data from local databases, provides six layouts for analysis. Researchers can see the dynamic characteristics of their own writing activity, the time and place of publication, and the thematic scope of research problems. They can also identify cooperation networks, and consequently, study the dependencies and regularities in their own scientific activity. The current article presents the results of a study of the application's usability and functionality as well as attempts to define different user groups. A survey about the interface was sent to select researchers employed at Nicolaus Copernicus University. The results were used to answer the question as to whether such a specialized visualization tool can significantly augment the individual information space of the contemporary researcher.

Date

21.12.2018 17:22:13

0.030483361 = product of:
  0.09145008 = sum of:
    0.014975886 = weight(_text_:information in 2595) [ClassicSimilarity], result of:
      0.014975886 = score(doc=2595,freq=8.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.19395474 = fieldWeight in 2595, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2595)
    0.0764742 = weight(_text_:united in 2595) [ClassicSimilarity], result of:
      0.0764742 = score(doc=2595,freq=2.0), product of:
        0.24675635 = queryWeight, product of:
          5.6101127 = idf(docFreq=439, maxDocs=44218)
          0.043984205 = queryNorm
        0.30991787 = fieldWeight in 2595, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6101127 = idf(docFreq=439, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2595)
  0.33333334 = coord(2/6)

Abstract

Purpose - This paper aims to explore the theory and practice of knowledge organization and its necessary connection to human perception, and shows a solution of the potential ones. Design/methodology/approach - The author attempts to survey the problem of concept-building and extension, as well as the determination of semantics in different aspects. The purpose is to find criteria for the choice of the solution that best incorporates users into the design cycles of knowledge organization systems. Findings - It is widely agreed that cognition provides the basis for concept-building; however, at the next stage of processing there is a debate. Fundamentally, what is the connection between perception and the superior cognitive processes? The perceptual method does not separate these two but rather considers them united, with perception permeating cognition. By contrast, the linguistic method considers perception as an information-receiving system. Separate from, and following, perception, the cognitive subsystems then perform information and data processing, leading to both knowledge organization and representation. We assume by that model that top-level concepts emerge from knowledge organization and representation. This paper points obvious connection of visual imagery and the internet; perceptual access of knowledge organization and information retrieval. There are some practical and characteristic solutions for the visualization of information without demand of completeness. Research limitations/implications - Librarians need to identify those semantic characteristics which stimulate a similar conceptual image both in the mind of the librarian and in the mind of the user. Originality/value - For a fresh perspective, an understanding of perception is required as well.

0.029668488 = product of:
  0.08900546 = sum of:
    0.023773482 = weight(_text_:information in 919) [ClassicSimilarity], result of:
      0.023773482 = score(doc=919,freq=14.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = 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.06523198 = weight(_text_:networks in 919) [ClassicSimilarity], result of:
      0.06523198 = score(doc=919,freq=2.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.31355235 = fieldWeight in 919, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.046875 = fieldNorm(doc=919)
  0.33333334 = coord(2/6)

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.

0.029668488 = product of:
  0.08900546 = sum of:
    0.023773482 = weight(_text_:information in 3356) [ClassicSimilarity], result of:
      0.023773482 = score(doc=3356,freq=14.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.3078936 = fieldWeight in 3356, 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=3356)
    0.06523198 = weight(_text_:networks in 3356) [ClassicSimilarity], result of:
      0.06523198 = score(doc=3356,freq=2.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.31355235 = fieldWeight in 3356, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.046875 = fieldNorm(doc=3356)
  0.33333334 = coord(2/6)

Abstract

In this article, we propose a graph-based interactive bibliographic information retrieval system-GIBIR. GIBIR provides an effective way to retrieve bibliographic information. The system represents bibliographic information as networks and provides a form-based query interface. Users can develop their queries interactively by referencing the system-generated graph queries. Complex queries such as "papers on information retrieval, which were cited by John's papers that had been presented in SIGIR" can be effectively answered by the system. We evaluate the proposed system by developing another relational database-based bibliographic information retrieval system with the same interface and functions. Experiment results show that the proposed system executes the same queries much faster than the relational database-based system, and on average, our system reduced the execution time by 72% (for 3-node query), 89% (for 4-node query), and 99% (for 5-node query).

Source

Journal of the Association for Information Science and Technology. 68(2017) no.2, S.480-490

0.025979813 = product of:
  0.077939436 = sum of:
    0.012707461 = weight(_text_:information in 3704) [ClassicSimilarity], result of:
      0.012707461 = score(doc=3704,freq=4.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.16457605 = fieldWeight in 3704, 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=3704)
    0.06523198 = weight(_text_:networks in 3704) [ClassicSimilarity], result of:
      0.06523198 = score(doc=3704,freq=2.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.31355235 = fieldWeight in 3704, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.046875 = fieldNorm(doc=3704)
  0.33333334 = coord(2/6)

Abstract

Using Google Earth, Google Maps, and/or network visualization programs such as Pajek, one can overlay the network of relations among addresses in scientific publications onto the geographic map. The authors discuss the pros and cons of various options, and provide software (freeware) for bridging existing gaps between the Science Citation Indices (Thomson Reuters) and Scopus (Elsevier), on the one hand, and these various visualization tools on the other. At the level of city names, the global map can be drawn reliably on the basis of the available address information. At the level of the names of organizations and institutes, there are problems of unification both in the ISI databases and with Scopus. Pajek enables a combination of visualization and statistical analysis, whereas the Google Maps and its derivatives provide superior tools on the Internet.

Source

Journal of the American Society for Information Science and Technology. 61(2010) no.8, S.1622-1634

0.023324315 = product of:
  0.06997294 = sum of:
    0.008471641 = weight(_text_:information in 4746) [ClassicSimilarity], result of:
      0.008471641 = score(doc=4746,freq=4.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.10971737 = fieldWeight in 4746, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=4746)
    0.0615013 = weight(_text_:networks in 4746) [ClassicSimilarity], result of:
      0.0615013 = score(doc=4746,freq=4.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.29562 = fieldWeight in 4746, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.03125 = fieldNorm(doc=4746)
  0.33333334 = coord(2/6)

Abstract

Many real-world domains can be represented as large node-link graphs: backbone Internet routers connect with 70,000 other hosts, mid-sized Web servers handle between 20,000 and 200,000 hyperlinked documents, and dictionaries contain millions of words defined in terms of each other. Computational manipulation of such large graphs is common, but previous tools for graph visualization have been limited to datasets of a few thousand nodes. Visual depictions of graphs and networks are external representations that exploit human visual processing to reduce the cognitive load of many tasks that require understanding of global or local structure. We assert that the two key advantages of computer-based systems for information visualization over traditional paper-based visual exposition are interactivity and scalability. We also argue that designing visualization software by taking the characteristics of a target user's task domain into account leads to systems that are more effective and scale to larger datasets than previous work. This thesis contains a detailed analysis of three specialized systems for the interactive exploration of large graphs, relating the intended tasks to the spatial layout and visual encoding choices. We present two novel algorithms for specialized layout and drawing that use quite different visual metaphors. The H3 system for visualizing the hyperlink structures of web sites scales to datasets of over 100,000 nodes by using a carefully chosen spanning tree as the layout backbone, 3D hyperbolic geometry for a Focus+Context view, and provides a fluid interactive experience through guaranteed frame rate drawing. The Constellation system features a highly specialized 2D layout intended to spatially encode domain-specific information for computational linguists checking the plausibility of a large semantic network created from dictionaries. The Planet Multicast system for displaying the tunnel topology of the Internet's multicast backbone provides a literal 3D geographic layout of arcs on a globe to help MBone maintainers find misconfigured long-distance tunnels. Each of these three systems provides a very different view of the graph structure, and we evaluate their efficacy for the intended task. We generalize these findings in our analysis of the importance of interactivity and specialization for graph visualization systems that are effective and scalable.

0.02249722 = product of:
  0.06749166 = sum of:
    0.0059903543 = weight(_text_:information in 2112) [ClassicSimilarity], result of:
      0.0059903543 = score(doc=2112,freq=2.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.0775819 = fieldWeight in 2112, 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=2112)
    0.0615013 = weight(_text_:networks in 2112) [ClassicSimilarity], result of:
      0.0615013 = score(doc=2112,freq=4.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.29562 = fieldWeight in 2112, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.03125 = fieldNorm(doc=2112)
  0.33333334 = coord(2/6)

Abstract

In the last few years, there is an increasing interest to generate visual representations of very large scientific domains. A methodology based on the combined use of ISI-JCR category cocitation and social networks analysis through the use of the Pathfinder algorithm has demonstrated its ability to achieve high quality, schematic visualizations for these kinds of domains. Now, the next step would be to generate these scientograms in an on-line fashion. To do so, there is a need to significantly decrease the run time of the latter pruning technique when working with category cocitation matrices of a large dimension like the ones handled in these large domains (Pathfinder has a time complexity order of O(n4), with n being the number of categories in the cocitation matrix, i.e., the number of nodes in the network). Although a previous improvement called Binary Pathfinder has already been proposed to speed up the original algorithm, its significant time complexity reduction is not enough for that aim. In this paper, we make use of a different shortest path computation from classical approaches in computer science graph theory to propose a new variant of the Pathfinder algorithm which allows us to reduce its time complexity in one order of magnitude, O(n3), and thus to significantly decrease the run time of the implementation when applied to large scientific domains considering the parameter q = n - 1. Besides, the new algorithm has a much simpler structure than the Binary Pathfinder as well as it saves a significant amount of memory with respect to the original Pathfinder by reducing the space complexity to the need of just storing two matrices. An experimental comparison will be developed using large networks from real-world domains to show the good performance of the new proposal.

Source

Information processing and management. 44(2008) no.4, S.1611-1623

0.02244316 = product of:
  0.06732948 = sum of:
    0.0129694985 = weight(_text_:information in 10) [ClassicSimilarity], result of:
      0.0129694985 = score(doc=10,freq=6.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.16796975 = fieldWeight in 10, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=10)
    0.054359984 = weight(_text_:networks in 10) [ClassicSimilarity], result of:
      0.054359984 = score(doc=10,freq=2.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.26129362 = fieldWeight in 10, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.0390625 = fieldNorm(doc=10)
  0.33333334 = coord(2/6)

Abstract

Recent efforts in biomedical visual question answering (VQA) research rely on combined information gathered from the image content and surrounding text supporting the figure. Biomedical journals are a rich source of information for such multimodal content indexing. For multipanel figures in these journals, it is critical to develop automatic figure panel splitting and label recognition algorithms to associate individual panels with text metadata in the figure caption and the body of the article. Challenges in this task include large variations in figure panel layout, label location, size, contrast to background, and so on. In this work, we propose a deep convolutional neural network, which splits the panels and recognizes the panel labels in a single step. Visual features are extracted from several layers at various depths of the backbone neural network and organized to form a feature pyramid. These features are fed into classification and regression networks to generate candidates of panels and their labels. These candidates are merged to create the final panel segmentation result through a beam search algorithm. We evaluated the proposed algorithm on the ImageCLEF data set and achieved better performance than the results reported in the literature. In order to thoroughly investigate the proposed algorithm, we also collected and annotated our own data set of 10,642 figures. The experiments, trained on 9,642 figures and evaluated on the remaining 1,000 figures, show that combining panel splitting and panel label recognition mutually benefit each other.

Source

Journal of the Association for Information Science and Technology. 71(2020) no.11, S.1327-1340

0.021649845 = product of:
  0.064949535 = sum of:
    0.01058955 = weight(_text_:information in 82) [ClassicSimilarity], result of:
      0.01058955 = score(doc=82,freq=4.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.13714671 = fieldWeight in 82, 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=82)
    0.054359984 = weight(_text_:networks in 82) [ClassicSimilarity], result of:
      0.054359984 = score(doc=82,freq=2.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.26129362 = fieldWeight in 82, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.0390625 = fieldNorm(doc=82)
  0.33333334 = coord(2/6)

Abstract

Aggregated journal-journal citation networks based on the Journal Citation Reports 2004 of the Science Citation Index (5,968 journals) and the Social Science Citation Index (1,712 journals) are made accessible from the perspective of any of these journals. A vector-space model Is used for normalization, and the results are brought online at http://www.leydesdorff.net/jcr04 as input files for the visualization program Pajek. The user is thus able to analyze the citation environment in terms of links and graphs. Furthermore, the local impact of a journal is defined as its share of the total citations in the specific journal's citation environments; the vertical size of the nodes is varied proportionally to this citation impact. The horizontal size of each node can be used to provide the same information after correction for within-journal (self-)citations. In the "citing" environment, the equivalents of this measure can be considered as a citation activity index which maps how the relevant journal environment is perceived by the collective of authors of a given journal. As a policy application, the mechanism of Interdisciplinary developments among the sciences is elaborated for the case of nanotechnology journals.

Source

Journal of the American Society for Information Science and Technology. 58(2007) no.1, S.25-38

0.017532133 = product of:
  0.052596398 = sum of:
    0.011206927 = weight(_text_:information in 1789) [ClassicSimilarity], result of:
      0.011206927 = score(doc=1789,freq=28.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.14514244 = fieldWeight in 1789, product of:
          5.2915025 = tf(freq=28.0), with freq of:
            28.0 = termFreq=28.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.015625 = fieldNorm(doc=1789)
    0.041389473 = sum of:
      0.029470965 = weight(_text_:states in 1789) [ClassicSimilarity], result of:
        0.029470965 = score(doc=1789,freq=2.0), product of:
          0.24220218 = queryWeight, product of:
            5.506572 = idf(docFreq=487, maxDocs=44218)
            0.043984205 = queryNorm
          0.121679194 = fieldWeight in 1789, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            5.506572 = idf(docFreq=487, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
      0.011918506 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
        0.011918506 = score(doc=1789,freq=2.0), product of:
          0.1540252 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.043984205 = queryNorm
          0.07738023 = fieldWeight in 1789, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
  0.33333334 = coord(2/6)

Date

23. 3.2008 19:10:22

Footnote

Rez. in: JASIST 54(2003) no.9, S.905-906 (C.A. Badurek): "Visual approaches for knowledge discovery in very large databases are a prime research need for information scientists focused an extracting meaningful information from the ever growing stores of data from a variety of domains, including business, the geosciences, and satellite and medical imagery. This work presents a summary of research efforts in the fields of data mining, knowledge discovery, and data visualization with the goal of aiding the integration of research approaches and techniques from these major fields. The editors, leading computer scientists from academia and industry, present a collection of 32 papers from contributors who are incorporating visualization and data mining techniques through academic research as well application development in industry and government agencies. Information Visualization focuses upon techniques to enhance the natural abilities of humans to visually understand data, in particular, large-scale data sets. It is primarily concerned with developing interactive graphical representations to enable users to more intuitively make sense of multidimensional data as part of the data exploration process. It includes research from computer science, psychology, human-computer interaction, statistics, and information science. Knowledge Discovery in Databases (KDD) most often refers to the process of mining databases for previously unknown patterns and trends in data. Data mining refers to the particular computational methods or algorithms used in this process. The data mining research field is most related to computational advances in database theory, artificial intelligence and machine learning. This work compiles research summaries from these main research areas in order to provide "a reference work containing the collection of thoughts and ideas of noted researchers from the fields of data mining and data visualization" (p. 8). It addresses these areas in three main sections: the first an data visualization, the second an KDD and model visualization, and the last an using visualization in the knowledge discovery process. The seven chapters of Part One focus upon methodologies and successful techniques from the field of Data Visualization. Hoffman and Grinstein (Chapter 2) give a particularly good overview of the field of data visualization and its potential application to data mining. An introduction to the terminology of data visualization, relation to perceptual and cognitive science, and discussion of the major visualization display techniques are presented. Discussion and illustration explain the usefulness and proper context of such data visualization techniques as scatter plots, 2D and 3D isosurfaces, glyphs, parallel coordinates, and radial coordinate visualizations. Remaining chapters present the need for standardization of visualization methods, discussion of user requirements in the development of tools, and examples of using information visualization in addressing research problems.
In 13 chapters, Part Two provides an introduction to KDD, an overview of data mining techniques, and examples of the usefulness of data model visualizations. The importance of visualization throughout the KDD process is stressed in many of the chapters. In particular, the need for measures of visualization effectiveness, benchmarking for identifying best practices, and the use of standardized sample data sets is convincingly presented. Many of the important data mining approaches are discussed in this complementary context. Cluster and outlier detection, classification techniques, and rule discovery algorithms are presented as the basic techniques common to the KDD process. The potential effectiveness of using visualization in the data modeling process are illustrated in chapters focused an using visualization for helping users understand the KDD process, ask questions and form hypotheses about their data, and evaluate the accuracy and veracity of their results. The 11 chapters of Part Three provide an overview of the KDD process and successful approaches to integrating KDD, data mining, and visualization in complementary domains. Rhodes (Chapter 21) begins this section with an excellent overview of the relation between the KDD process and data mining techniques. He states that the "primary goals of data mining are to describe the existing data and to predict the behavior or characteristics of future data of the same type" (p. 281). These goals are met by data mining tasks such as classification, regression, clustering, summarization, dependency modeling, and change or deviation detection. Subsequent chapters demonstrate how visualization can aid users in the interactive process of knowledge discovery by graphically representing the results from these iterative tasks. Finally, examples of the usefulness of integrating visualization and data mining tools in the domain of business, imagery and text mining, and massive data sets are provided. This text concludes with a thorough and useful 17-page index and lengthy yet integrating 17-page summary of the academic and industrial backgrounds of the contributing authors. A 16-page set of color inserts provide a better representation of the visualizations discussed, and a URL provided suggests that readers may view all the book's figures in color on-line, although as of this submission date it only provides access to a summary of the book and its contents. The overall contribution of this work is its focus an bridging two distinct areas of research, making it a valuable addition to the Morgan Kaufmann Series in Database Management Systems. The editors of this text have met their main goal of providing the first textbook integrating knowledge discovery, data mining, and visualization. Although it contributes greatly to our under- standing of the development and current state of the field, a major weakness of this text is that there is no concluding chapter to discuss the contributions of the sum of these contributed papers or give direction to possible future areas of research. "Integration of expertise between two different disciplines is a difficult process of communication and reeducation. Integrating data mining and visualization is particularly complex because each of these fields in itself must draw an a wide range of research experience" (p. 300). Although this work contributes to the crossdisciplinary communication needed to advance visualization in KDD, a more formal call for an interdisciplinary research agenda in a concluding chapter would have provided a more satisfying conclusion to a very good introductory text.
With contributors almost exclusively from the computer science field, the intended audience of this work is heavily slanted towards a computer science perspective. However, it is highly readable and provides introductory material that would be useful to information scientists from a variety of domains. Yet, much interesting work in information visualization from other fields could have been included giving the work more of an interdisciplinary perspective to complement their goals of integrating work in this area. Unfortunately, many of the application chapters are these, shallow, and lack complementary illustrations of visualization techniques or user interfaces used. However, they do provide insight into the many applications being developed in this rapidly expanding field. The authors have successfully put together a highly useful reference text for the data mining and information visualization communities. Those interested in a good introduction and overview of complementary research areas in these fields will be satisfied with this collection of papers. The focus upon integrating data visualization with data mining complements texts in each of these fields, such as Advances in Knowledge Discovery and Data Mining (Fayyad et al., MIT Press) and Readings in Information Visualization: Using Vision to Think (Card et. al., Morgan Kauffman). This unique work is a good starting point for future interaction between researchers in the fields of data visualization and data mining and makes a good accompaniment for a course focused an integrating these areas or to the main reference texts in these fields."

LCSH

Information visualization

RSWK

Information Retrieval (BVB)

Subject

Information Retrieval (BVB)
Information visualization

0.014354773 = product of:
  0.04306432 = sum of:
    0.015884325 = weight(_text_:information in 1211) [ClassicSimilarity], result of:
      0.015884325 = score(doc=1211,freq=36.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = 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.027179992 = weight(_text_:networks in 1211) [ClassicSimilarity], result of:
      0.027179992 = score(doc=1211,freq=2.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.13064681 = fieldWeight in 1211, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.01953125 = fieldNorm(doc=1211)
  0.33333334 = coord(2/6)

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.

0.013074098 = product of:
  0.039222293 = sum of:
    0.008471641 = weight(_text_:information in 3884) [ClassicSimilarity], result of:
      0.008471641 = score(doc=3884,freq=16.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.10971737 = fieldWeight in 3884, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.015625 = fieldNorm(doc=3884)
    0.03075065 = weight(_text_:networks in 3884) [ClassicSimilarity], result of:
      0.03075065 = score(doc=3884,freq=4.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.14781 = fieldWeight in 3884, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.015625 = fieldNorm(doc=3884)
  0.33333334 = coord(2/6)

Footnote

Rez. in: JASIST 56(2005) no.10, S.1126-1128 (P.K. Nayar): "How Images Think is an exercise both in philosophical meditation and critical theorizing about media, images, affects, and cognition. Burnett combines the insights of neuroscience with theories of cognition and the computer sciences. He argues that contemporary metaphors - biological or mechanical - about either cognition, images, or computer intelligence severely limit our understanding of the image. He suggests in his introduction that "image" refers to the "complex set of interactions that constitute everyday life in image-worlds" (p. xviii). For Burnett the fact that increasing amounts of intelligence are being programmed into technologies and devices that use images as their main form of interaction and communication-computers, for instance-suggests that images are interfaces, structuring interaction, people, and the environment they share. New technologies are not simply extensions of human abilities and needs-they literally enlarge cultural and social preconceptions of the relationship between body and mind. The flow of information today is part of a continuum, with exceptional events standing as punctuation marks. This flow connects a variety of sources, some of which are continuous - available 24 hours - or "live" and radically alters issues of memory and history. Television and the Internet, notes Burnett, are not simply a simulated world-they are the world, and the distinctions between "natural" and "non-natural" have disappeared. Increasingly, we immerse ourselves in the image, as if we are there. We rarely become conscious of the fact that we are watching images of events-for all perceptioe, cognitive, and interpretive purposes, the image is the event for us. The proximity and distance of viewer from/with the viewed has altered so significantly that the screen is us. However, this is not to suggest that we are simply passive consumers of images. As Burnett points out, painstakingly, issues of creativity are involved in the process of visualization-viewwes generate what they see in the images. This involves the historical moment of viewing-such as viewing images of the WTC bombings-and the act of re-imagining. As Burnett puts it, "the questions about what is pictured and what is real have to do with vantage points [of the viewer] and not necessarily what is in the image" (p. 26). In his second chapter Burnett moves an to a discussion of "imagescapes." Analyzing the analogue-digital programming of images, Burnett uses the concept of "reverie" to describe the viewing experience. The reverie is a "giving in" to the viewing experience, a "state" in which conscious ("I am sitting down an this sofa to watch TV") and unconscious (pleasure, pain, anxiety) processes interact. Meaning emerges in the not-always easy or "clean" process of hybridization. This "enhances" the thinking process beyond the boundaries of either image or subject. Hybridization is the space of intelligence, exchange, and communication.
Moving an to virtual images, Burnett posits the existence of "microcultures": places where people take control of the means of creation and production in order to makes sense of their social and cultural experiences. Driven by the need for community, such microcultures generate specific images as part of a cultural movement (Burnett in fact argues that microcultures make it possible for a "small cinema of twenty-five seats to become part of a cultural movement" [p. 63]), where the process of visualization-which involves an awareness of the historical moment - is central to the info-world and imagescapes presented. The computer becomms an archive, a history. The challenge is not only of preserving information, but also of extracting information. Visualization increasingly involves this process of picking a "vantage point" in order to selectively assimilate the information. In virtual reality systems, and in the digital age in general, the distance between what is being pictured and what is experienced is overcome. Images used to be treated as opaque or transparent films among experience, perception, and thought. But, now, images are taken to another level, where the viewer is immersed in the image-experience. Burnett argues-though this is hardly a fresh insight-that "interactivity is only possible when images are the raw material used by participants to change if not transform the purpose of their viewing experience" (p. 90). He suggests that a work of art, "does not start its life as an image ... it gains the status of image when it is placed into a context of viewing and visualization" (p. 90). With simulations and cyberspace the viewing experience has been changed utterly. Burnett defines simulation as "mapping different realities into images that have an environmental, cultural, and social form" (p. 95). However, the emphasis in Burnett is significant-he suggests that interactivity is not achieved through effects, but as a result of experiences attached to stories. Narrative is not merely the effect of technology-it is as much about awareness as it is about Fantasy. Heightened awareness, which is popular culture's aim at all times, and now available through head-mounted displays (HMD), also involves human emotions and the subtleties of human intuition.
The sixth chapter looks at this interfacing of humans and machines and begins with a series of questions. The crucial one, to my mind, is this: "Does the distinction between humans and technology contribute to a lack of understanding of the continuous interrelationship and interdependence that exists between humans and all of their creations?" (p. 125) Burnett suggests that to use biological or mechanical views of the computer/mind (the computer as an input/output device) Limits our understanding of the ways in which we interact with machines. He thus points to the role of language, the conversations (including the one we held with machines when we were children) that seem to suggest a wholly different kind of relationship. Peer-to-peer communication (P2P), which is arguably the most widely used exchange mode of images today, is the subject of chapter seven. The issue here is whether P2P affects community building or community destruction. Burnett argues that the trope of community can be used to explore the flow of historical events that make up a continuum-from 17th-century letter writing to e-mail. In the new media-and Burnett uses the example of popular music which can be sampled, and reedited to create new compositions - the interpretive space is more flexible. Private networks can be set up, and the process of information retrieval (about which Burnett has already expended considerable space in the early chapters) involves a lot more of visualization. P2P networks, as Burnett points out, are about information management. They are about the harmony between machines and humans, and constitute a new ecology of communications. Turning to computer games, Burnett looks at the processes of interaction, experience, and reconstruction in simulated artificial life worlds, animations, and video images. For Burnett (like Andrew Darley, 2000 and Richard Doyle, 2003) the interactivity of the new media games suggests a greater degree of engagement with imageworlds. Today many facets of looking, listening, and gazing can be turned into aesthetic forms with the new media. Digital technology literally reanimates the world, as Burnett demonstrates in bis concluding chapter. Burnett concludes that images no longer simply represent the world-they shape our very interaction with it; they become the foundation for our understanding the spaces, places, and historical moments that we inhabit. Burnett concludes his book with the suggestion that intelligence is now a distributed phenomenon (here closely paralleling Katherine Hayles' argument that subjectivity is dispersed through the cybernetic circuit, 1999). There is no one center of information or knowledge. Intersections of human creativity, work, and connectivity "spread" (Burnett's term) "intelligence through the use of mediated devices and images, as well as sounds" (p. 221).

Theme

Information

0.012663476 = product of:
  0.03799043 = sum of:
    0.012707461 = weight(_text_:information in 3355) [ClassicSimilarity], result of:
      0.012707461 = score(doc=3355,freq=4.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.16457605 = fieldWeight in 3355, 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=3355)
    0.02528297 = product of:
      0.05056594 = sum of:
        0.05056594 = weight(_text_:22 in 3355) [ClassicSimilarity], result of:
          0.05056594 = score(doc=3355,freq=4.0), product of:
            0.1540252 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043984205 = queryNorm
            0.32829654 = fieldWeight in 3355, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=3355)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Date

22. 1.2017 16:54:03
22. 1.2017 17:10:56

LCSH

Information visualization

Subject

Information visualization

0.012553902 = product of:
  0.07532341 = sum of:
    0.07532341 = weight(_text_:networks in 595) [ClassicSimilarity], result of:
      0.07532341 = score(doc=595,freq=6.0), product of:
        0.20804176 = queryWeight, product of:
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.043984205 = queryNorm
        0.3620591 = fieldWeight in 595, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.72992 = idf(docFreq=1060, maxDocs=44218)
          0.03125 = fieldNorm(doc=595)
  0.16666667 = coord(1/6)

Abstract

Science maps are visual representations of the structure and dynamics of scholarly knowl­edge. They aim to show how fields, disciplines, journals, scientists, publications, and scientific terms relate to each other. Science mapping is the body of methods and techniques that have been developed for generating science maps. This entry is an introduction to science maps and science mapping. It focuses on the conceptual, theoretical, and methodological issues of science mapping, rather than on the mathematical formulation of science mapping techniques. After a brief history of science mapping, we describe the general procedure for building a science map, presenting the data sources and the methods to select, clean, and pre-process the data. Next, we examine in detail how the most common types of science maps, namely the citation-based and the term-based, are generated. Both are based on networks: the former on the network of publications connected by citations, the latter on the network of terms co-occurring in publications. We review the rationale behind these mapping approaches, as well as the techniques and methods to build the maps (from the extraction of the network to the visualization and enrichment of the map). We also present less-common types of science maps, including co-authorship networks, interlocking editorship networks, maps based on patents' data, and geographic maps of science. Moreover, we consider how time can be represented in science maps to investigate the dynamics of science. We also discuss some epistemological and sociological topics that can help in the interpretation, contextualization, and assessment of science maps. Then, we present some possible applications of science maps in science policy. In the conclusion, we point out why science mapping may be interesting for all the branches of meta-science, from knowl­edge organization to epistemology.

0.011894252 = product of:
  0.035682756 = sum of:
    0.014825371 = weight(_text_:information in 2500) [ClassicSimilarity], result of:
      0.014825371 = score(doc=2500,freq=4.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.1920054 = fieldWeight in 2500, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2500)
    0.020857384 = product of:
      0.04171477 = sum of:
        0.04171477 = weight(_text_:22 in 2500) [ClassicSimilarity], result of:
          0.04171477 = score(doc=2500,freq=2.0), product of:
            0.1540252 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043984205 = queryNorm
            0.2708308 = fieldWeight in 2500, 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=2500)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

Semantische Netze unterstützen den Suchvorgang im Information Retrieval. Sie bestehen aus relationierten Begriffen und helfen dem Nutzer das richtige Vokabular zur Fragebildung zu finden. Eine leicht und intuitiv erfassbare Darstellung und eine interaktive Bedienungsmöglichkeit optimieren den Suchprozess mit der Begriffsstruktur. Als Interaktionsform bietet sich Hy-pertext mit dem etablierte Point- und Klickverfahren an. Eine Visualisierung zur Unterstützung kognitiver Fähigkeiten kann durch eine Darstellung der Informationen mit Hilfe von Punkten und Linien erfolgen. Vorgestellt wer-den die Anwendungsbeispiele Wissensnetz im Brockhaus multimedial, WordSurfer der Firma BiblioMondo, SpiderSearch der Firma BOND und Topic Maps Visualization in dandelon.com und im Portal Informationswis-senschaft der Firma AGI - Information Management Consultants.

Date

30. 1.2007 18:22:41

0.011147052 = product of:
  0.033441156 = sum of:
    0.015563398 = weight(_text_:information in 1289) [ClassicSimilarity], result of:
      0.015563398 = score(doc=1289,freq=6.0), product of:
        0.0772133 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.043984205 = queryNorm
        0.20156369 = fieldWeight in 1289, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=1289)
    0.017877758 = product of:
      0.035755515 = sum of:
        0.035755515 = weight(_text_:22 in 1289) [ClassicSimilarity], result of:
          0.035755515 = score(doc=1289,freq=2.0), product of:
            0.1540252 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043984205 = queryNorm
            0.23214069 = fieldWeight in 1289, 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=1289)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

QVIZ will research and create a framework for visualizing and querying archival resources by a time-space interface based on maps and emergent knowledge structures. The framework will also integrate social software, such as wikis, in order to utilize knowledge in existing and new communities of practice. QVIZ will lead to improved information sharing and knowledge creation, easier access to information in a user-adapted context and innovative ways of exploring and visualizing materials over time, between countries and other administrative units. The common European framework for sharing and accessing archival information provided by the QVIZ project will open a considerably larger commercial market based on archival materials as well as a richer understanding of European history.

Content

Vortrag anlässlich des Workshops: "Extending the multilingual capacity of The European Library in the EDL project Stockholm, Swedish National Library, 22-23 November 2007".