Diese Datenbank enthält über 40.000 Dokumente zu Themen aus den Bereichen Formalerschließung – Inhaltserschließung – Information Retrieval.
© 2015 W. Gödert, TH Köln, Institut für Informationswissenschaft / Powered by litecat, BIS Oldenburg (Stand: 04. Juni 2021)
1Leydesdorff, L. ; Moya-Anegón, F. de ; Guerrero-Bote, V.P.: Journal maps, interactive overlays, and the measurement of interdisciplinarity on the basis of Scopus data (1996-2012).
In: Journal of the Association for Information Science and Technology. 66(2015) no.5, S.1001-1016.
Abstract: Using Scopus data, we construct a global map of science based on aggregated journal-journal citations from 1996-2012 (N of journals?=?20,554). This base map enables users to overlay downloads from Scopus interactively. Using a single year (e.g., 2012), results can be compared with mappings based on the Journal Citation Reports at the Web of Science (N?=?10,936). The Scopus maps are more detailed at both the local and global levels because of their greater coverage, including, for example, the arts and humanities. The base maps can be interactively overlaid with journal distributions in sets downloaded from Scopus, for example, for the purpose of portfolio analysis. Rao-Stirling diversity can be used as a measure of interdisciplinarity in the sets under study. Maps at the global and the local level, however, can be very different because of the different levels of aggregation involved. Two journals, for example, can both belong to the humanities in the global map, but participate in different specialty structures locally. The base map and interactive tools are available online (with instructions) at http://www.leydesdorff.net/scopus_ovl.
Inhalt: Vgl.: http://onlinelibrary.wiley.com/doi/10.1002/asi.23243/abstract.
2Leydesdorff, L. ; Moya-Anegón, F.de ; Guerrero-Bote, V.P.: Journal maps on the basis of Scopus data : a comparison with the Journal Citation Reports of the ISI.
In: Journal of the American Society for Information Science and Technology. 61(2010) no.2, S.352-369.
Abstract: Using the Scopus dataset (1996-2007) a grand matrix of aggregated journal-journal citations was constructed. This matrix can be compared in terms of the network structures with the matrix contained in the Journal Citation Reports (JCR) of the Institute of Scientific Information (ISI). Because the Scopus database contains a larger number of journals and covers the humanities, one would expect richer maps. However, the matrix is in this case sparser than in the case of the ISI data. This is because of (a) the larger number of journals covered by Scopus and (b) the historical record of citations older than 10 years contained in the ISI database. When the data is highly structured, as in the case of large journals, the maps are comparable, although one may have to vary a threshold (because of the differences in densities). In the case of interdisciplinary journals and journals in the social sciences and humanities, the new database does not add a lot to what is possible with the ISI databases.
Themenfeld: Informetrie ; Citation indexing
Objekt: Scopus ; Journal Citation Reports
3Quirin, A. ; Cordón, O. ; Guerrero-Bote, V.P. ; Vargas-Quesada, B. ; Moya-Anegón, F.: A quick MST-based algorithm to obtain Pathfinder networks (oo, n - 1).
In: Journal of the American Society for Information Science and Technology. 59(2008) no.12, S.1912-1924.
Abstract: Network scaling algorithms such as the Pathfinder algorithm are used to prune many different kinds of networks, including citation networks, random networks, and social networks. However, this algorithm suffers from run time problems for large networks and online processing due to its O(n**4) time complexity. In this article, we introduce a new alternative, the MST-Pathfinder algorithm, which will allow us to prune the original network to get its PFNET(oo, n - 1) in just O(n**2 · log n) time. The underlying idea comes from the fact that the union (superposition) of all the Minimum Spanning Trees extracted from a given network is equivalent to the PFNET resulting from the Pathfinder algorithm parameterized by a specific set of values (r = oo and q = n - 1), those usually considered in many different applications. Although this property is well-known in the literature, it seems that no algorithm based on it has been proposed, up to now, to decrease the high computational cost of the original Pathfinder algorithm. We also present a mathematical proof of the correctness of this new alternative and test its good efficiency in two different case studies: one dedicated to the post-processing of large random graphs, and the other one to a real world case in which medium networks obtained by a cocitation analysis of the scientific domains in different countries are pruned.
4Reyes-Barragán, M.J. ; Guerrero-Bote, V.P. ; Moya-Anegón, F.: Colaboración interregional e intraregional en España (1990-2002).
In: ¬La interdisciplinariedad y la transdisciplinariedad en la organización del conocimiento científico : actas del VIII Congreso ISKO-España, León, 18, 19 y 20 de Abril de 2007 : Interdisciplinarity and transdisciplinarity in the organization of scientific knowledge. Ed.: B. Rodriguez Bravo u. M.L Alvite Diez. León : Universidad de León, Secretariado de Publicaciones, 2007. S.331-339.
Anmerkung: Originaltitel: Inter-regional and intraregional collaboration in Spain, 1990-2002
5Faba-Pérez, C. ; Zapico-Alonso, F. ; Guerrero-Bote, V.P. ; Moya-Anegón, F. de: Comparative analysis of webometric measurements in thematic environments.
In: Journal of the American Society for Information Science and Technology. 56(2005) no.8, S.779-785.
Abstract: There have been many attempts to evaluate Web spaces an the basis of the information that they provide, their form or functionality, or even the importance given to each of them by the Web itself. The indicators that have been developed for this purpose fall into two groups: those based an the study of a Web space's formal characteristics, and those related to its link structure. In this study we examine most of the webometric indicators that have been proposed in the literature together with others of our own design by applying them to a set of thematically related Web spaces and analyzing the relationships between the different indicators.
Themenfeld: Internet ; Informetrie
6Faba-Perez, C. ; Guerrero-Bote, V.P. ; Moya-Anegon, F. de: Self-organizing maps of Web spaces based an formal characteristics.
In: Information processing and management. 41(2005) no.2, S.331-346.
Abstract: The unceasing growth of electronic information available on the Web has made it indispensable to develop tools to analyse and evaluate its quality. Given the subjectivity underlying most of the qualitative analytical indicators at the present time, we here propose the use of characteristics or indicators of a formal character. We apply Kohonen's neural networks and study their topological organization in order to analyse how Web spaces behave with respect to these networks' formal characteristics. The interpretation of the results brings out the underlying structures and relationships in a closed Web environment.
7Faba-Pérez, C. ; Guerrero-Bote, V.P. ; Moya-Anegón, F.: "Sitation" distributions and Bradford's law in a closed Web space.
In: Journal of documentation. 59(2003) no.5, S.558-580.
Abstract: The study looks at how well the distribution of "sitations" (inlinks received by Web spaces) fits either a power law (of the Lotka type) or a bibliometric distribution for printed publications (of the Bradford type). The experimental sample examines the sitations found in a closed generic environment of thematically-related Web sites - the case of Extremadura (Spain). Two sets of data, varying several parameters, were used. The sitation distributions found were coherent with those described in previous experiments of this type, including in the exponent. The plots of accumulated clusters of sitations and targets, however, did not fit the typical Bradford distribution.
Anmerkung: Vgl. auch unter: http://www.emeraldinsight.com/10.1108/00220410310499582.
Objekt: Lotka-Verteilung ; Bradford-Verteilung
8López-Pujalte, C. ; Guerrero-Bote, V.P. ; Moya-Anegón, F. de: Order-based fitness functions for genetic algorithms applied to relevance feedback.
In: Journal of the American Society for Information Science and technology. 54(2003) no.2, S.152-160.
Abstract: Lopez-Pujalte and Guerrero-Bote test a relevance feedback genetic algorithm while varying its order based fitness functions and generating a function based upon the Ide dec-hi method as a base line. Using the non-zero weighted term types assigned to the query, and to the initially retrieved set of documents, as genes, a chromosome of equal length is created for each. The algorithm is provided with the chromosomes for judged relevant documents, for judged irrelevant documents, and for the irrelevant documents with their terms negated. The algorithm uses random selection of all possible genes, but gives greater likelihood to those with higher fitness values. When the fittest chromosome of a previous population is eliminated it is restored while the least fittest of the new population is eliminated in its stead. A crossover probability of .8 and a mutation probability of .2 were used with 20 generations. Three fitness functions were utilized; the Horng and Yeh function which takes into account the position of relevant documents, and two new functions, one based on accumulating the cosine similarity for retrieved documents, the other on stored fixed-recall-interval precessions. The Cranfield collection was used with the first 15 documents retrieved from 33 queries chosen to have at least 3 relevant documents in the first 15 and at least 5 relevant documents not initially retrieved. Precision was calculated at fixed recall levels using the residual collection method which removes viewed documents. One of the three functions improved the original retrieval by127 percent, while the Ide dec-hi method provided a 120 percent improvement.
Themenfeld: Retrievalstudien ; Retrievalalgorithmen
9López-Pujalte, C. ; Guerrero-Bote, V.P. ; Moya-Anegón, F. de: Genetic algorithms in relevance feedback : a second test and new contributions.
In: Information processing and management. 39(2003) no.5, S.669-687.
Abstract: The present work is the continuation of an earlier study which reviewed the literature on relevance feedback genetic techniques that follow the vector space model (the model that is most commonly used in this type of application), and implemented them so that they could be compared with each other as well as with one of the best traditional methods of relevance feedback--the Ide dec-hi method. We here carry out the comparisons on more test collections (Cranfield, CISI, Medline, and NPL), using the residual collection method for their evaluation as is recommended in this type of technique. We also add some fitness functions of our own design.
10Guerrero-Bote, V.P. ; Moya Anegón, F. de ; Herrero Solana, V.: Document organization using Kohonen's algorithm.
In: Information processing and management. 38(2002) no.1, S.79-89.
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.
Themenfeld: Automatisches Klassifizieren ; Retrievalalgorithmen