Search (7 results, page 1 of 1)

  • × author_ss:"Moya Anegón, F. de"
  1. Herrero-Solana, V.; Moya Anegón, F. de: Graphical Table of Contents (GTOC) for library collections : the application of UDC codes for the subject maps (2003) 0.02
    0.01604558 = product of:
      0.048136737 = sum of:
        0.021169065 = weight(_text_:of in 2758) [ClassicSimilarity], result of:
          0.021169065 = score(doc=2758,freq=50.0), product of:
            0.061262865 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03917671 = queryNorm
            0.34554482 = fieldWeight in 2758, product of:
              7.071068 = tf(freq=50.0), with freq of:
                50.0 = termFreq=50.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03125 = fieldNorm(doc=2758)
        0.016351866 = weight(_text_:systems in 2758) [ClassicSimilarity], result of:
          0.016351866 = score(doc=2758,freq=2.0), product of:
            0.12039685 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.03917671 = queryNorm
            0.1358164 = fieldWeight in 2758, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.03125 = fieldNorm(doc=2758)
        0.010615807 = product of:
          0.021231614 = sum of:
            0.021231614 = weight(_text_:22 in 2758) [ClassicSimilarity], result of:
              0.021231614 = score(doc=2758,freq=2.0), product of:
                0.13719016 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03917671 = queryNorm
                0.15476047 = fieldWeight in 2758, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03125 = fieldNorm(doc=2758)
          0.5 = coord(1/2)
      0.33333334 = coord(3/9)
    
    Abstract
    The representation of information contents by graphical maps is an extended ongoing research topic. In this paper we introduce the application of UDC codes for the subject maps development. We use the following graphic representation methodologies: 1) Multidimensional scaling (MDS), 2) Cluster analysis, 3) Neural networks (Self Organizing Map - SOM). Finally, we conclude about the application viability of every kind of map. 1. Introduction Advanced techniques for Information Retrieval (IR) currently make up one of the most active areas for research in the field of library and information science. New models representing document content are replacing the classic systems in which the search terms supplied by the user were compared against the indexing terms existing in the inverted files of a database. One of the topics most often studied in the last years is bibliographic browsing, a good complement to querying strategies. Since the 80's, many authors have treated this topic. For example, Ellis establishes that browsing is based an three different types of tasks: identification, familiarization and differentiation (Ellis, 1989). On the other hand, Cove indicates three different browsing types: searching browsing, general purpose browsing and serendipity browsing (Cove, 1988). Marcia Bates presents six different types (Bates, 1989), although the classification of Bawden is the one that really interests us: 1) similarity comparison, 2) structure driven, 3) global vision (Bawden, 1993). The global vision browsing implies the use of graphic representations, which we will call map displays, that allow the user to get a global idea of the nature and structure of the information in the database. In the 90's, several authors worked an this research line, developing different types of maps. One of the most active was Xia Lin what introduced the concept of Graphical Table of Contents (GTOC), comparing the maps to true table of contents based an graphic representations (Lin 1996). Lin applies the algorithm SOM to his own personal bibliography, analyzed in function of the words of the title and abstract fields, and represented in a two-dimensional map (Lin 1997). Later on, Lin applied this type of maps to create websites GTOCs, through a Java application.
    Date
    12. 9.2004 14:31:22
    Source
    Challenges in knowledge representation and organization for the 21st century: Integration of knowledge across boundaries. Proceedings of the 7th ISKO International Conference Granada, Spain, July 10-13, 2002. Ed.: M. López-Huertas
  2. Guerrero-Bote, V.P.; Moya Anegón, F. de; Herrero Solana, V.: Document organization using Kohonen's algorithm (2002) 0.01
    0.012589732 = product of:
      0.056653794 = sum of:
        0.023950063 = weight(_text_:of in 2564) [ClassicSimilarity], result of:
          0.023950063 = score(doc=2564,freq=16.0), product of:
            0.061262865 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03917671 = queryNorm
            0.39093933 = fieldWeight in 2564, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.0625 = fieldNorm(doc=2564)
        0.03270373 = weight(_text_:systems in 2564) [ClassicSimilarity], result of:
          0.03270373 = score(doc=2564,freq=2.0), product of:
            0.12039685 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.03917671 = queryNorm
            0.2716328 = fieldWeight in 2564, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0625 = fieldNorm(doc=2564)
      0.22222222 = coord(2/9)
    
    Abstract
    The classification of documents from a bibliographic database is a task that is linked to processes of information retrieval based on partial matching. A method is described of vectorizing reference documents from LISA which permits their topological organization using Kohonen's algorithm. As an example a map is generated of 202 documents from LISA, and an analysis is made of the possibilities of this type of neural network with respect to the development of information retrieval systems based on graphical browsing.
  3. Guerrero, V.P.; Moya Anegón, F. de: Reduction of the dimension of a document space using the fuzzified output of a Kohonen network (2001) 0.00
    0.0022314154 = product of:
      0.020082738 = sum of:
        0.020082738 = weight(_text_:of in 6935) [ClassicSimilarity], result of:
          0.020082738 = score(doc=6935,freq=20.0), product of:
            0.061262865 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03917671 = queryNorm
            0.32781258 = fieldWeight in 6935, product of:
              4.472136 = tf(freq=20.0), with freq of:
                20.0 = termFreq=20.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.046875 = fieldNorm(doc=6935)
      0.11111111 = coord(1/9)
    
    Abstract
    The vectors used in IR, whether to represent the documents or the terms, are high dimensional, and their dimensions increase as one approaches real problems. The algorithms used to manipulate them, however, consume enormously increasing amounts of computational capacity as the said dimension grows. We used the Kohonen algorithm and a fuzzification module to perform a fuzzy clustering of the terms. The degrees of membership obtained were used to represent the terms and, by extension, the documents, yielding a smaller number of components but still endowed with meaning. To test the results, we use a topological classification of sets of transformed and untransformed vectors to check that the same structure underlies both.
    Source
    Journal of the American Society for Information Science and technology. 52(2001) no.14, S.1234-1241
  4. Moya Anegón, F. de; López-Huertas, M.J.: ¬An automatic model for updating the conceptual structure of a scientific discipline (2000) 0.00
    0.0019396065 = product of:
      0.017456459 = sum of:
        0.017456459 = weight(_text_:of in 126) [ClassicSimilarity], result of:
          0.017456459 = score(doc=126,freq=34.0), product of:
            0.061262865 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03917671 = queryNorm
            0.28494355 = fieldWeight in 126, product of:
              5.8309517 = tf(freq=34.0), with freq of:
                34.0 = termFreq=34.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03125 = fieldNorm(doc=126)
      0.11111111 = coord(1/9)
    
    Abstract
    Knowledge changes and evolves with time. This makes it necessary for classifications and other information retrieval tools to be revised periodically to ensure that they represent an updated organization of knowledge. This problem worsens in the case of some scientific disciplines because of their degree of internal specialization and dynamism. This is the case with Biotechnology and Applied Microbiology (category taken from the Journal Citation Reports (JCR)). A way of solving this problem can be by means of an automatic classification, but also by applying multivariate techniques of analysis and neural networks. This work deals with the two last procedures. The source chosen for doing this work is the Science Citation Index (SCI-CD) database, chosen because it contains the best publications on the disciplines studied - a guarantee for them to be represented properly. We are especially concerned with the quality of the representation. All of the journals dealing with Biotechnology and Applied Microbiology in the database (152) have been selected. Each document has been represented according to the references that it includes. From this point three co-citation matrices were generated: authors, journals and articles from each document. This technique implies the use of complementary methods for document representation by the way of the three matrices processed by multivariate techniques (MDS, PCA, CA). The result is that it can be determined which classes form the intellectual structure of the disciplines studied. This would be of great help for automatic updating of bibliographic classifications and other information retrieval tools. At the same time, these techniques can work as robots for document classification, authors and publications, and allows for the generation of knowledge maps that can be used as interfaces for accessing the documents from their location in a database..
    Source
    Dynamism and stability in knowledge organization: Proceedings of the 6th International ISKO-Conference, 10-13 July 2000, Toronto, Canada. Ed.: C. Beghtol et al
  5. Cordón, O.; Herrera-Viedma, E.; Luque, M.; Moya Anegón, F. de; Zarco, C.: ¬An inductive query by example technique for extended Boolean queries based on simulated annealing-programming (2003) 0.00
    0.0017284468 = product of:
      0.015556021 = sum of:
        0.015556021 = weight(_text_:of in 2757) [ClassicSimilarity], result of:
          0.015556021 = score(doc=2757,freq=12.0), product of:
            0.061262865 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03917671 = queryNorm
            0.25392252 = fieldWeight in 2757, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.046875 = fieldNorm(doc=2757)
      0.11111111 = coord(1/9)
    
    Abstract
    One of the key problem that non-expert users have to deal with when using an Information Retrieval System is the need to deeply know its query language in order to express their information needs in the form of a valid query allowing them to retrieve relevant information. To solve this problem, Inductive Query by Example techniques can be considered to automatically derive queries from a set of relevant documents provided by a user. In this paper, a new hybrid evolutionary technique is proposed to automatically leam extended Boolean queries and is compared to Kraft et al.'s approach in several queries of the well known Cranfield collection.
    Source
    Challenges in knowledge representation and organization for the 21st century: Integration of knowledge across boundaries. Proceedings of the 7th ISKO International Conference Granada, Spain, July 10-13, 2002. Ed.: M. López-Huertas
  6. Lancho Barrantes, B.S.; Guerrero Bote, V.P.; Chinchilla Rodríguez, Z.; Moya Anegón, F. de: Citation flows in the zones of influence of scientific collaborations (2012) 0.00
    0.001577849 = product of:
      0.014200641 = sum of:
        0.014200641 = weight(_text_:of in 68) [ClassicSimilarity], result of:
          0.014200641 = score(doc=68,freq=10.0), product of:
            0.061262865 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03917671 = queryNorm
            0.23179851 = fieldWeight in 68, 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=68)
      0.11111111 = coord(1/9)
    
    Abstract
    Domestic citation to papers from the same country and the greater citation impact of documents involving international collaboration are two phenomena that have been extensively studied and contrasted. Here, however, we show that it is not so much a national bias, but that papers have a greater impact on their immediate environments, an impact that is diluted as that environment grows. For this reason, the greatest biases are observed in countries with a limited production. Papers that involve international collaboration have a greater impact in general, on the one hand, because they have multiple "immediate environments," and on the other because of their greater quality or prestige. In short, one can say that science knows no frontiers. Certainly there is a greater impact on the authors' immediate environment, but this does not necessarily have to coincide with their national environments, which fade in importance as the collaborative environment expands.
    Source
    Journal of the American Society for Information Science and Technology. 63(2012) no.3, S.481-489
  7. Bornmann, L.; Moya Anegón, F. de; Mutz, R.: Do universities or research institutions with a specific subject profile have an advantage or a disadvantage in institutional rankings? (2013) 0.00
    0.0014112709 = product of:
      0.012701439 = sum of:
        0.012701439 = weight(_text_:of in 1109) [ClassicSimilarity], result of:
          0.012701439 = score(doc=1109,freq=8.0), product of:
            0.061262865 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03917671 = queryNorm
            0.20732689 = fieldWeight in 1109, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.046875 = fieldNorm(doc=1109)
      0.11111111 = coord(1/9)
    
    Abstract
    Using data compiled for the SCImago Institutions Ranking, we look at whether the subject area type an institution (university or research-focused institution) belongs to (in terms of the fields researched) has an influence on its ranking position. We used latent class analysis to categorize institutions based on their publications in certain subject areas. Even though this categorization does not relate directly to scientific performance, our results show that it exercises an important influence on the outcome of a performance measurement: Certain subject area types of institutions have an advantage in the ranking positions when compared with others. This advantage manifests itself not only when performance is measured with an indicator that is not field-normalized but also for indicators that are field-normalized.
    Source
    Journal of the American Society for Information Science and Technology. 64(2013) no.11, S.2310-2316