Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wolfgang Glänzel

dblp:78/3081 · DBLP profile ↗
← Back
18ranked-venue papers
4as first author
0since 2021 · last 2016
0000-0001-7529-5198ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 16 · 4 first-authorArtificial intelligence and machine learning · 2Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 90% Information retrieval · 10%
Theoretical computer science
1 paper
Algorithms and data structures · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.222013
Multiview Partitioning via Tensor Methods · IEEE Trans. Knowl. Data Eng. 2013
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis · KDD 2007
Data mining › clustering
multi-view clustering
0.212013
Multiview Partitioning via Tensor Methods · IEEE Trans. Knowl. Data Eng. 2013
Data mining › clustering
spectral clustering
0.212013
Multiview Partitioning via Tensor Methods · IEEE Trans. Knowl. Data Eng. 2013
Algorithms and data structures
clustering
0.112012
Optimized Data Fusion for Kernel k-Means Clustering · IEEE Trans. Pattern Anal. Mach. Intell. 2012
Algorithms and data structures › clustering › k-means clustering
kernel k-means
0.112012
Optimized Data Fusion for Kernel k-Means Clustering · IEEE Trans. Pattern Anal. Mach. Intell. 2012
Bioinformatics and computational biology
multi-omics data integration
0.112011
Optimized data fusion for K-means Laplacian clustering · Bioinform. 2011
Information retrieval
citation analysis
0.112007
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis · KDD 2007
Data mining › clustering
hybrid clustering
0.112007
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis · KDD 2007

Methods — techniques the papers use, named apart from their topics

alternating minimization · 0.3tensor decomposition · 0.2frobenius norm · 0.2rayleigh quotient optimization · 0.1pagerank · 0.1latent semantic indexing · 0.1fisher's inverse chi-square · 0.1HITS · 0.1rayleigh quotient · 0.1multiple kernel learning · 0.1
YearPublicationVenuePosition
2016 Diversity of references as an indicator of the interdisciplinarity of journals: Taking similarity between subject fields into account
abstract
The objective of this article is to further the study of journal interdisciplinarity, or, more generally, knowledge integration at the level of individual articles. Interdisciplinarity is operationalized by the diversity of subject fields assigned to cited items in the article's reference list. Subject fields and subfields were obtained from the L euven‐ B udapest ( ECOOM ) subject‐classification scheme, while disciplinary diversity was measured taking variety, balance, and disparity into account. As diversity measure we use a H ill‐type true diversity in the sense of J ost and L einster‐ C obbold. The analysis is conducted in 3 steps. In the first part, the properties of this measure are discussed, and, on the basis of these properties it is shown that the measure has the potential to serve as an indicator of interdisciplinarity. In the second part the applicability of this indicator is shown using selected journals from several research fields ranging from mathematics to social sciences. Finally, the often‐heard argument, namely, that interdisciplinary research exhibits larger visibility and impact, is studied on the basis of these selected journals. Yet, as only 7 journals, representing a total of 15,757 articles, are studied, albeit chosen to cover a large range of interdisciplinarity, further research is still needed.
Lin Zhang 0004, Ronald Rousseau 0001, Wolfgang Glänzel
J. Assoc. Inf. Sci. Technol.3
2013 Opportunities for and limitations of the Book Citation Index
abstract
This article offers important background information about a new product, the Book Citation Index (BKCI), launched in 2011 by Thomson Reuters. Information is illustrated by some new facts concerning The BKCI's use in bibliometrics, coverage analysis, and a series of idiosyncrasies worthy of further discussion. The BKCI was launched primarily to assist researchers identify useful and relevant research that was previously invisible to them, owing to the lack of significant book content in citation indexes such as the Web of Science. So far, the content of 33,000 books has been added to the desktops of the global research community, the majority in the arts, humanities, and social sciences fields. Initial analyses of the data from The BKCI have indicated that The BKCI, in its current version, should not be used for bibliometric or evaluative purposes. The most significant limitations to this potential application are the high share of publications without address information, the inflation of publication counts, the lack of cumulative citation counts from different hierarchical levels, and inconsistency in citation counts between the cited reference search and the book citation index. However, The BKCI is a first step toward creating a reliable and necessary citation data source for monographs — a very challenging issue, because, unlike journals and conference proceedings, books have specific requirements, and several problems emerge not only in the context of subject classification, but also in their role as cited publications and in citing publications.
Juan Gorraiz, Philip James Purnell, Wolfgang Glänzel
J. Assoc. Inf. Sci. Technol.3
2013 What does scientometrics share with other "metrics" sciences?
abstract
In this article, the authors answer the question of whether the field of scientometrics/bibliometrics shares essential characteristics of “metrics” sciences. To achieve this objective, the citation network of seven selected metrics and their information environment is analyzed.
Lin Zhang 0004, Bart Thijs, Wolfgang Glänzel
J. Assoc. Inf. Sci. Technol.3
2013 Multiview Partitioning via Tensor Methods
abstract
Clustering by integrating multiview representations has become a crucial issue for knowledge discovery in heterogeneous environments. However, most prior approaches assume that the multiple representations share the same dimension, limiting their applicability to homogeneous environments. In this paper, we present a novel tensor-based framework for integrating heterogeneous multiview data in the context of spectral clustering. Our framework includes two novel formulations; that is multiview clustering based on the integration of the Frobenius-norm objective function (MC-FR-OI) and that based on matrix integration in the Frobenius-norm objective function (MC-FR-MI). We show that the solutions for both formulations can be computed by tensor decompositions. We evaluated our methods on synthetic data and two real-world data sets in comparison with baseline methods. Experimental results demonstrate that the proposed formulations are effective in integrating multiview data in heterogeneous environments.
Xinhai Liu, Shuiwang Ji, Wolfgang Glänzel, Bart De Moor
IEEE Trans. Knowl. Data Eng.3
2012 A visual representation of relative first-citation times
abstract
A new visual representation of the response time, i.e., the time elapsed between the publication year and the date of the first citation of a paper, is provided. This presentation can be used to detect and describe different paradigmatic types of reception speed for scientific journals.
Wolfgang Glänzel, Ronald Rousseau 0001, Lin Zhang 0004
J. Assoc. Inf. Sci. Technol.1
2012 Optimized Data Fusion for Kernel k-Means Clustering
abstract
This paper presents a novel optimized kernel k-means algorithm (OKKC) to combine multiple data sources for clustering analysis. The algorithm uses an alternating minimization framework to optimize the cluster membership and kernel coefficients as a nonconvex problem. In the proposed algorithm, the problem to optimize the cluster membership and the problem to optimize the kernel coefficients are all based on the same Rayleigh quotient objective; therefore the proposed algorithm converges locally. OKKC has a simpler procedure and lower complexity than other algorithms proposed in the literature. Simulated and real-life data fusion applications are experimentally studied, and the results validate that the proposed algorithm has comparable performance, moreover, it is more efficient on large-scale data sets. (The Matlab implementation of OKKC algorithm is downloadable from http://homes.esat.kuleuven.be/~sistawww/bio/syu/okkc.html.).
Léon-Charles Tranchevent, Xinhai Liu, Wolfgang Glänzel, Johan A. K. Suykens, Bart De Moor, Yves Moreau
IEEE Trans. Pattern Anal. Mach. Intell.4
2011 Optimized data fusion for K-means Laplacian clustering
abstract
MOTIVATION: We propose a novel algorithm to combine multiple kernels and Laplacians for clustering analysis. The new algorithm is formulated on a Rayleigh quotient objective function and is solved as a bi-level alternating minimization procedure. Using the proposed algorithm, the coefficients of kernels and Laplacians can be optimized automatically. RESULTS: Three variants of the algorithm are proposed. The performance is systematically validated on two real-life data fusion applications. The proposed Optimized Kernel Laplacian Clustering (OKLC) algorithms perform significantly better than other methods. Moreover, the coefficients of kernels and Laplacians optimized by OKLC show some correlation with the rank of performance of individual data source. Though in our evaluation the K values are predefined, in practical studies, the optimal cluster number can be consistently estimated from the eigenspectrum of the combined kernel Laplacian matrix. AVAILABILITY: The MATLAB code of algorithms implemented in this paper is downloadable from http://homes.esat.kuleuven.be/~sistawww/bioi/syu/oklc.html.
Xinhai Liu, Léon-Charles Tranchevent, Wolfgang Glänzel, Johan A. K. Suykens, Bart De Moor, Yves Moreau
Bioinform.4
2011 Document-type country profiles
abstract
A bibliometric method for analyzing and visualizing national research profiles is adapted to describe national preferences for publishing particular document types. Similarities in national profiles and national peculiarities are discussed based on the publication output of the 26 most active countries indexed in the Web of Science annual volume 2007.
Lin Zhang 0004, Ronald Rousseau 0001, Wolfgang Glänzel
J. Assoc. Inf. Sci. Technol.3
2010 Weighted hybrid clustering by combining text mining and bibliometrics on a large-scale journal database
abstract
Abstract We propose a new hybrid clustering framework to incorporate text mining with bibliometrics in journal set analysis. The framework integrates two different approaches: clustering ensemble and kernel‐fusion clustering. To improve the flexibility and the efficiency of processing large‐scale data, we propose an information‐based weighting scheme to leverage the effect of multiple data sources in hybrid clustering. Three different algorithms are extended by the proposed weighting scheme and they are employed on a large journal set retrieved from the Web of Science (WoS) database. The clustering performance of the proposed algorithms is systematically evaluated using multiple evaluation methods, and they were cross‐compared with alternative methods. Experimental results demonstrate that the proposed weighted hybrid clustering strategy is superior to other methods in clustering performance and efficiency. The proposed approach also provides a more refined structural mapping of journal sets, which is useful for monitoring and detecting new trends in different scientific fields.
Xinhai Liu, Frizo A. L. Janssens, Wolfgang Glänzel, Yves Moreau, Bart De Moor
J. Assoc. Inf. Sci. Technol.4
2009 Hybrid Clustering of Text Mining and Bibliometrics Applied to Journal Sets
abstract
To obtain correlated and complementary information contained in text mining and bibliometrics, hybrid clustering to incorporate textual content and citation information has become a popular strategy. In this paper, we propose a new computational framework of integrating text mining and bibliometrics to provide a mapping of journal sets. Two different approaches of hybrid clustering methods are applied in this paper. The first category is ensemble clustering, which combines different clustering results obtained from individual data into a consolidated clustering result. The second category is kernel fusion, which maps heterogeneous data sets into the kernel space and combines the kernel matrices for clustering. Kernels can be combined either averagely, or by an optimized weighted linear combination model. In this paper, we propose a novel adaptive kernel K-means clustering algorithm to combine textual content and citation information for clustering. The proposed algorithm is systematically compared with other methods on a clustering problem of 1869 journals published in 2002–2006. Based on several validation indices, the experimental results demonstrate that our hybrid clustering strategy is able to provide clustering result as well as the best individual data source.
Xinhai Liu, Yves Moreau, Bart De Moor, Wolfgang Glänzel, Frizo A. L. Janssens
SDM5
2009 Hybrid clustering for validation and improvement of subject-classification schemes
Frizo A. L. Janssens, Lin Zhang 0004, Bart De Moor, Wolfgang Glänzel
Inf. Process. Manag.4
2007 Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis
abstract
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1981–2004. For delineating this complex, interdisciplinary field, a novel bibliometric retrieval strategy is used. Given that the performance of unsupervised clustering and classification of scientific publications is significantly improved by deeply merging textual contents with the structure of the citation graph, we proceed with a hybrid clustering method based on Fisher’s inverse chi-square. The optimal number of clusters is determined by a compound semi-automatic strategy comprising a combination of distance-based and stability-based methods. We also investigate the relationship between number of Latent Semantic Indexing factors, number of clusters, and clustering performance. The HITS and PageRank algorithms are used to determine representative publications in each cluster. Next, we develop a methodology for dynamic hybrid clustering of evolving bibliographic data sets. The same clustering methodology is applied to consecutive periods defined by time windows on the set, and in a subsequent phase chains are formed by matching and tracking clusters through time. Term networks for the eleven resulting cluster chains present the cognitive structure of the field. Finally, we provide a view on how much attention the bioinformatics community has devoted to the different subfields through time.
Frizo A. L. Janssens, Wolfgang Glänzel, Bart De Moor
KDD2
2006 Towards mapping library and information science
Frizo A. L. Janssens, Jacqueline Leta, Wolfgang Glänzel, Bart De Moor
Inf. Process. Manag.3
2005 Combining full text and bibliometric information in mapping scientific disciplines
Patrick Glenisson, Wolfgang Glänzel, Frizo A. L. Janssens, Bart De Moor
Inf. Process. Manag.2
1999 A Bibliometric Study of Reference Literature in the Sciences and Social Sciences
Wolfgang Glänzel, Urs Schoepflin
Inf. Process. Manag.1
1995 Predictive Aspects of a Stochastic Model for Citation Processes
Wolfgang Glänzel, András Schubert
Inf. Process. Manag.1
1992 On Some Stopping Times of Citation Processes. From Theory to Indicators
Wolfgang Glänzel
Inf. Process. Manag.1
1990 Computer bibliometrics for journal classification
Radosvet Todorov, Wolfgang Glänzel
Inf. Process. Manag.2