Search (29 results, page 1 of 2)

0.043186974 = product of:
  0.06478046 = sum of:
    0.022779156 = weight(_text_:of in 3035) [ClassicSimilarity], result of:
      0.022779156 = score(doc=3035,freq=58.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.27912235 = fieldWeight in 3035, product of:
          7.615773 = tf(freq=58.0), with freq of:
            58.0 = termFreq=58.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0234375 = fieldNorm(doc=3035)
    0.042001307 = sum of:
      0.020788899 = weight(_text_:science in 3035) [ClassicSimilarity], result of:
        0.020788899 = score(doc=3035,freq=6.0), product of:
          0.13747036 = queryWeight, product of:
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.05218836 = queryNorm
          0.15122458 = fieldWeight in 3035, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.0234375 = fieldNorm(doc=3035)
      0.021212406 = weight(_text_:22 in 3035) [ClassicSimilarity], result of:
        0.021212406 = score(doc=3035,freq=2.0), product of:
          0.18275474 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05218836 = 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.6666667 = coord(2/3)

Abstract

A PICTURE is said to be worth a thousand words. That metaphor might be expected to pertain a fortiori in the case of scientific papers, where a figure can brilliantly illuminate an idea that might otherwise be baffling. Papers with figures in them should thus be easier to grasp than those without. They should therefore reach larger audiences and, in turn, be more influential simply by virtue of being more widely read. But are they?

Content

Bill Howe and his colleagues at the University of Washington, in Seattle, decided to find out. First, they trained a computer algorithm to distinguish between various sorts of figures-which they defined as diagrams, equations, photographs, plots (such as bar charts and scatter graphs) and tables. They exposed their algorithm to between 400 and 600 images of each of these types of figure until it could distinguish them with an accuracy greater than 90%. Then they set it loose on the more-than-650,000 papers (containing more than 10m figures) stored on PubMed Central, an online archive of biomedical-research articles. To measure each paper's influence, they calculated its article-level Eigenfactor score-a modified version of the PageRank algorithm Google uses to provide the most relevant results for internet searches. Eigenfactor scoring gives a better measure than simply noting the number of times a paper is cited elsewhere, because it weights citations by their influence. A citation in a paper that is itself highly cited is worth more than one in a paper that is not.
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.

Footnote

Vgl.: http://www.economist.com/news/science-and-technology/21700620-surprisingly-simple-test-check-research-papers-errors-come-again.

0.026752979 = product of:
  0.040129468 = sum of:
    0.01891706 = weight(_text_:of in 1289) [ClassicSimilarity], result of:
      0.01891706 = score(doc=1289,freq=10.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.23179851 = fieldWeight in 1289, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.046875 = fieldNorm(doc=1289)
    0.021212406 = product of:
      0.042424813 = sum of:
        0.042424813 = weight(_text_:22 in 1289) [ClassicSimilarity], result of:
          0.042424813 = score(doc=1289,freq=2.0), product of:
            0.18275474 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05218836 = 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.6666667 = coord(2/3)

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".

0.021100847 = product of:
  0.03165127 = sum of:
    0.020335227 = weight(_text_:of in 2547) [ClassicSimilarity], result of:
      0.020335227 = score(doc=2547,freq=26.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.2491759 = fieldWeight in 2547, product of:
          5.0990195 = tf(freq=26.0), with freq of:
            26.0 = termFreq=26.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03125 = fieldNorm(doc=2547)
    0.011316041 = product of:
      0.022632083 = sum of:
        0.022632083 = weight(_text_:science in 2547) [ClassicSimilarity], result of:
          0.022632083 = score(doc=2547,freq=4.0), product of:
            0.13747036 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.05218836 = queryNorm
            0.16463245 = fieldWeight in 2547, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.03125 = fieldNorm(doc=2547)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

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.

Content

Paper presented at: IFLA WLIC 2015 - Cape Town, South Africa in Session 141 - Science and Technology.

0.009947985 = product of:
  0.029843956 = sum of:
    0.029843956 = weight(_text_:of in 4743) [ClassicSimilarity], result of:
      0.029843956 = score(doc=4743,freq=14.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.36569026 = fieldWeight in 4743, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0625 = fieldNorm(doc=4743)
  0.33333334 = coord(1/3)

Abstract

In this paper, we describe in detail the Information Content Evaluation Map (ICE-Map Visualization, formerly referred to as IC Difference Analysis). The ICE-Map Visualization is a visual data mining approach for all kinds of concept hierarchies that uses statistics about the concept usage to help a user in the evaluation and maintenance of the hierarchy. It consists of a statistical framework that employs the the notion of information content from information theory, as well as a visualization of the hierarchy and the result of the statistical analysis by means of a treemap.

0.009399963 = product of:
  0.028199887 = sum of:
    0.028199887 = weight(_text_:of in 3869) [ClassicSimilarity], result of:
      0.028199887 = score(doc=3869,freq=32.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.34554482 = fieldWeight in 3869, product of:
          5.656854 = tf(freq=32.0), with freq of:
            32.0 = termFreq=32.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3869)
  0.33333334 = coord(1/3)

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.

0.009305488 = product of:
  0.027916465 = sum of:
    0.027916465 = weight(_text_:of in 3886) [ClassicSimilarity], result of:
      0.027916465 = score(doc=3886,freq=16.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.34207192 = fieldWeight in 3886, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3886)
  0.33333334 = coord(1/3)

Abstract

The paper investigates the acceleration of t-SNE-an embedding technique that is commonly used for the visualization of high-dimensional data in scatter plots-using two tree-based algorithms. In particular, the paper develops variants of the Barnes-Hut algorithm and of the dual-tree algorithm that approximate the gradient used for learning t-SNE embeddings in O(N*logN). Our experiments show that the resulting algorithms substantially accelerate t-SNE, and that they make it possible to learn embeddings of data sets with millions of objects. Somewhat counterintuitively, the Barnes-Hut variant of t-SNE appears to outperform the dual-tree variant.

Source

Journal of machine learning research. 15(2014), S.3221-3245

0.0092100445 = product of:
  0.027630134 = sum of:
    0.027630134 = weight(_text_:of in 580) [ClassicSimilarity], result of:
      0.027630134 = score(doc=580,freq=12.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.33856338 = fieldWeight in 580, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0625 = fieldNorm(doc=580)
  0.33333334 = coord(1/3)

Abstract

A dentograph is a visualization of a library's collection built on the idea that a classification scheme is a mathematical function mapping one set of things (books or the universe of knowledge) onto another (a set of numbers and letters). Dentographs can visualize aspects of just one collection or can be used to compare two or more collections. This article describes how to build them, with examples and code using Ruby and R, and discusses some problems and future directions.

0.008817947 = product of:
  0.02645384 = sum of:
    0.02645384 = weight(_text_:of in 1292) [ClassicSimilarity], result of:
      0.02645384 = score(doc=1292,freq=44.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.3241498 = fieldWeight in 1292, product of:
          6.6332498 = tf(freq=44.0), with freq of:
            44.0 = termFreq=44.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03125 = fieldNorm(doc=1292)
  0.33333334 = coord(1/3)

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.

0.008704487 = product of:
  0.026113462 = sum of:
    0.026113462 = weight(_text_:of in 3883) [ClassicSimilarity], result of:
      0.026113462 = score(doc=3883,freq=14.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.31997898 = fieldWeight in 3883, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3883)
  0.33333334 = coord(1/3)

Abstract

The paper presents a new unsupervised dimensionality reduction technique, called parametric t-SNE, that learns a parametric mapping between the high-dimensional data space and the low-dimensional latent space. Parametric t-SNE learns the parametric mapping in such a way that the local structure of the data is preserved as well as possible in the latent space. We evaluate the performance of parametric t-SNE in experiments on three datasets, in which we compare it to the performance of two other unsupervised parametric dimensionality reduction techniques. The results of experiments illustrate the strong performance of parametric t-SNE, in particular, in learning settings in which the dimensionality of the latent space is relatively low.

Source

Proceedings of the Twelfth International Conference on Artificial Intelligence & Statistics (AI-STATS), JMLR W&CP 5, 2009. S.384-391

0.008615207 = product of:
  0.02584562 = sum of:
    0.02584562 = weight(_text_:of in 4746) [ClassicSimilarity], result of:
      0.02584562 = score(doc=4746,freq=42.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.31669703 = fieldWeight in 4746, product of:
          6.4807405 = tf(freq=42.0), with freq of:
            42.0 = termFreq=42.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03125 = fieldNorm(doc=4746)
  0.33333334 = coord(1/3)

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.008459966 = product of:
  0.025379896 = sum of:
    0.025379896 = weight(_text_:of in 2131) [ClassicSimilarity], result of:
      0.025379896 = score(doc=2131,freq=18.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.3109903 = fieldWeight in 2131, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.046875 = fieldNorm(doc=2131)
  0.33333334 = coord(1/3)

Abstract

This is a preprint to be published in the Extensions & Corrections to the UDC. The paper explains the basic functions of browsing and searching that need to be supported in relation to analytico-synthetic classifications such as Universal Decimal Classification (UDC), irrespective of any specific, real-life implementation. UDC is an example of a semi-faceted system that can be used, for instance, for both post-coordinate searching and hierarchical/facet browsing. The advantages of using a classification for IR, however, depend on the strength of the GUI, which should provide a user-friendly interface to classification browsing and searching. The power of this interface is in supporting visualisation that will 'convert' what is potentially a user-unfriendly indexing language based on symbols, to a subject presentation that is easy to understand, search and navigate. A summary of the basic functions of searching and browsing a classification that may be provided on a user-friendly interface is given and examples of classification browsing interfaces are provided.

0.007976132 = product of:
  0.023928396 = sum of:
    0.023928396 = weight(_text_:of in 919) [ClassicSimilarity], result of:
      0.023928396 = score(doc=919,freq=16.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.2932045 = fieldWeight in 919, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.046875 = fieldNorm(doc=919)
  0.33333334 = coord(1/3)

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.007976132 = product of:
  0.023928396 = sum of:
    0.023928396 = weight(_text_:of in 1293) [ClassicSimilarity], result of:
      0.023928396 = score(doc=1293,freq=16.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.2932045 = fieldWeight in 1293, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.046875 = fieldNorm(doc=1293)
  0.33333334 = coord(1/3)

Abstract

This paper aims to identify what information visualisation is and how in conjunction with the computer it can be used as a tool to expand understanding. It also seeks to explain how information visualisation has been fundamental to the development of the computer from its very early days to Apple's launch of the now ubiquitous W.I.M.P (Windows, Icon, Menu, Program) graphical user interface in 1984. An attempt is also made to question why after many years of progress and development though the late 1960s and 1970s, very little has changed in the way we interact with the data on our computers since the watershed of the Macintosh and in conclusion where the future of information visualisation may lie.

Content

Dissertation for MA degree in electronic media, School of Humanities, Oxford Brookes University

0.007794037 = product of:
  0.02338211 = sum of:
    0.02338211 = weight(_text_:of in 3870) [ClassicSimilarity], result of:
      0.02338211 = score(doc=3870,freq=22.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.28651062 = fieldWeight in 3870, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3870)
  0.33333334 = coord(1/3)

Abstract

Data from multiple knowledge organization systems are combined to provide a global overview of the content holdings of a small personal library. Subject headings and classification data are used to effectively map the combined book and topic space of the library. While harvested and manipulated by hand, the work reveals issues and potential solutions when using automated techniques to produce topic maps of much larger libraries. The small library visualized consists of the thirty-nine, digital, English language books found in the Osama Bin Laden (OBL) compound in Abbottabad, Pakistan upon his death. As this list of books has garnered considerable media attention, it is worth providing a visual overview of the subject content of these books - some of which is not readily apparent from the titles. Metadata from subject headings and classification numbers was combined to create book-subject maps. Tree maps of the classification data were also produced. The books contain 328 subject headings. In order to enhance the base map with meaningful thematic overlay, library holding count data was also harvested (and aggregated from duplicates). This additional data revealed the relative scarcity or popularity of individual books.

0.007794037 = product of:
  0.02338211 = sum of:
    0.02338211 = weight(_text_:of in 3888) [ClassicSimilarity], result of:
      0.02338211 = score(doc=3888,freq=22.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.28651062 = fieldWeight in 3888, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3888)
  0.33333334 = coord(1/3)

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.

Source

Journal of machine learning research. 9(2008), S.2579-2605

0.0077228574 = product of:
  0.023168571 = sum of:
    0.023168571 = weight(_text_:of in 1197) [ClassicSimilarity], result of:
      0.023168571 = score(doc=1197,freq=60.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.28389403 = fieldWeight in 1197, product of:
          7.745967 = tf(freq=60.0), with freq of:
            60.0 = termFreq=60.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1197)
  0.33333334 = coord(1/3)

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.007460989 = product of:
  0.022382967 = sum of:
    0.022382967 = weight(_text_:of in 1202) [ClassicSimilarity], result of:
      0.022382967 = score(doc=1202,freq=56.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.2742677 = fieldWeight in 1202, product of:
          7.483315 = tf(freq=56.0), with freq of:
            56.0 = termFreq=56.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1202)
  0.33333334 = coord(1/3)

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.

0.0074313222 = product of:
  0.022293966 = sum of:
    0.022293966 = weight(_text_:of in 548) [ClassicSimilarity], result of:
      0.022293966 = score(doc=548,freq=20.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.27317715 = fieldWeight in 548, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0390625 = fieldNorm(doc=548)
  0.33333334 = coord(1/3)

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.

0.0070499713 = product of:
  0.021149913 = sum of:
    0.021149913 = weight(_text_:of in 3366) [ClassicSimilarity], result of:
      0.021149913 = score(doc=3366,freq=18.0), product of:
        0.08160993 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.05218836 = queryNorm
        0.25915858 = fieldWeight in 3366, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3366)
  0.33333334 = coord(1/3)

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.

0.006929633 = product of:
  0.020788899 = sum of:
    0.020788899 = product of:
      0.041577797 = sum of:
        0.041577797 = weight(_text_:science in 3067) [ClassicSimilarity], result of:
          0.041577797 = score(doc=3067,freq=6.0), product of:
            0.13747036 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.05218836 = queryNorm
            0.30244917 = fieldWeight in 3067, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.046875 = fieldNorm(doc=3067)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Zielsetzung - Aufgrund der rasch wachsenden Anzahl an Publikationen zur Informationskompetenz ergibt sich eine zunehmende Notwendigkeit von Überblicksarbeiten. Dieser Betrag hat das Ziel, mittels Science Mapping einen Überblick über die wissenschaftliche Literatur zu schaffen. Forschungsmethoden - Unter Verwendung von BibExcel und VOSviewer wurden 1589 wissenschaftliche Artikel analysiert und drei verschiedene Visualisierungen erstellt. Ergebnisse - Es gibt ein relativ großes internationales Autorennetzwerk, in welchem die meisten Hauptakteure miteinander in Verbindung stehen. Die wichtigsten Schwerpunkte sind: Vermittlung von Informationskompetenz im Hochschulbereich, Prozessmodelle zum Informationssuchverhalten, Phänomenographie und Informationskompetenz im beruflichen Umfeld. Schlussfolgerungen - Viele der Schwerpunkte wurden schon vereinzelt in Review-Artikeln genannt, aber noch nie via Science Mapping zusammen visualisiert. Somit ermöglicht diese Arbeit erstmalig ein »big picture« der Produktionslandschaft. Künftige Arbeiten könnten die Literatur mit anderen Science Mapping Tools bzw. Visualisierungstechniken untersuchen.