The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Two-Stage Topic Extraction Model for Bibliometric Data Analysis Based on Word Embeddings and Clustering
Open accessAbstract
Topic extraction is an essential task in bibliometric data analysis, data mining and knowledge discovery, which seeks to identify significant topics from text collections. The conventional topic extraction schemes require human intervention and involve also comprehensive pre-processing tasks to represent text collections in an appropriate way. In this paper, we present a two-stage framework for topic extraction from scientific literature. The presented scheme employs a two-staged procedure, where word embedding schemes have been utilized in conjunction with cluster analysis. To extract significant topics from text collections, we propose an improved word embedding scheme, which incorporates word vectors obtained by word2vec, POS2vec, word-position2vec and LDA2vec schemes. In the clustering phase, an improved clustering ensemble framework, which incorporates conventional clustering methods (i.e., k-means, k-modes, k-means++, self-organizing maps and DIANA algorithm) by means of the iterative voting consensus, has been presented. In the empirical analysis, we analyze a corpus containing 160,424 abstracts of articles from various disciplines, including agricultural engineering, economics, engineering and computer science. In the experimental analysis, performance of the proposed scheme has been compared to conventional baseline clustering methods (such as, k-means, k-modes, and k-means++), LDA-based topic modelling and conventional word embedding schemes. The empirical analysis reveals that ensemble word embedding scheme yields better predictive performance compared to the baseline word vectors for topic extraction. Ensemble clustering framework outperforms the baseline clustering methods. The results obtained by the proposed framework show an improvement in Jaccard coefficient, Folkes & Mallows measure and F1 score.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
Learning Word Vectors for Sentiment Analysis
Maas, A. L., Daly, R. E., Pham, P. T., Huang, D., Ng, A. Y., & Potts, C. (2011) · Cited by 6,961
Kittler, J., Hatef, M., Duin, R. P. W., & Matas, J. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.667881 · Cited by 5,290
Distributed Representations of Sentences and Documents
Le, Q. V., & Mikolov, T. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.4053 · Cited by 4,934
Hierarchical Attention Networks for Document Classification
Yang, Z., Yang, D., Dyer, C., He, X., Smola, A., & Hovy, E. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/n16-1174 · Cited by 4,712
Deep Learning: Methods and Applications
Deng, L., & Yu, D. (2014) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000039 · Cited by 3,480
Semantics derived automatically from language corpora contain human-like biases
Caliskan, A., Bryson, J. J., & Narayanan, A. (2017) · Science · doi:10.1126/science.aal4230 · Cited by 2,887
Convolutional Sequence to Sequence Learning
Gehring, J., Auli, M., Grangier, D., Yarats, D., & Dauphin, Y. N. (2017) · arXiv · doi:10.48550/arxiv.1705.03122 · Cited by 2,850 · cited 1×
“The representation of position information for words can be essential stage for computational linguistic tasks [40].”
BackgroundClustering of the self-organizing map
Vesanto, J., & Alhoniemi, E. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846731 · Cited by 2,680
Reasoning With Neural Tensor Networks for Knowledge Base Completion
Socher, R., Chen, D., Manning, C. D., & Ng, A. Y. (2013) · Cited by 1,667
Learning Sentiment-Specific Word Embedding for Twitter Sentiment Classification
Tang, D., Wei, F., Yang, N., Zhou, M., Liu, T., & Qin, B. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.3115/v1/p14-1146 · Cited by 1,181
Ensemble of keyword extraction methods and classifiers in text classification
Onan, A., Korukoğlu, S., & Bulut, H. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.03.045 · Cited by 630
Self-citationA Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining.
Huang, J. Z. (1997) · Cited by 551
Support vector machines and Word2vec for text classification with semantic features
Lilleberg, J., Zhu, Y., & Zhang, Y. (2015) · 2015 IEEE 14th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC) · doi:10.1109/icci-cc.2015.7259377 · Cited by 459
TopicRank: Graph-Based Topic Ranking for Keyphrase Extraction
Bougouin, A., Boudin, F., & Daille, B. (2013) · Cited by 328
Sentiment analysis based on improved pre-trained word embeddings
Rezaeinia, S. M., Rahmani, R., Ghodsi, A., & Veisi, H. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.08.044 · Cited by 325
Onan, A., Korukoğlu, S., & Bulut, H. (2017) · Information Processing & Management · doi:10.1016/j.ipm.2017.02.008 · Cited by 305
Self-citationCuriskis, S. A., Drake, B., Osborn, T. R., & Kennedy, P. J. (2020) · Information Processing & Management · doi:10.1016/j.ipm.2019.04.002 · Cited by 304
A Deeper Look into Sarcastic Tweets Using Deep Convolutional Neural Networks
Poria, S., Cambria, E., Hazarika, D., & Vij, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.08815 · Cited by 292
Boyack, K. W., Newman, D., Duhon, R. J., Klavans, R., Patek, M., Biberstine, J. R., Schijvenaars, B., Skupin, A., Ma, N., & Börner, K. (2011) · PLoS ONE · doi:10.1371/journal.pone.0018029 · Cited by 271
Nguyen, N., & Caruana, R. (2007) · Seventh IEEE International Conference on Data Mining (ICDM 2007) · doi:10.1109/icdm.2007.73 · Cited by 252
Mixing Dirichlet Topic Models and Word Embeddings to Make lda2vecPreprint
Moody, C. E. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.02019 · Cited by 234
Python Text Processing with NLTK 2.0 Cookbook
Perkins, J. (2010) · CERN Document Server (European Organization for Nuclear Research) · Cited by 231
Peters, H. P. F., & van Raan, A. F. J. (1993) · Research Policy · doi:10.1016/0048-7333(93)90031-c · Cited by 209
Representation learning for very short texts using weighted word embedding aggregation
De Boom, C., Van Canneyt, S., Demeester, T., & Dhoedt, B. (2016) · Pattern Recognition Letters · doi:10.1016/j.patrec.2016.06.012 · Cited by 199
Ghosh, J., & Acharya, A. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.32 · Cited by 187
Cluster ensembles: A survey of approaches with recent extensions and applications
Boongoen, T., & Iam-On, N. (2018) · Computer Science Review · doi:10.1016/j.cosrev.2018.01.003 · Cited by 174
Zhang, Y., Zhang, G., Chen, H., Porter, A. L., Zhu, D., & Lu, J. (2016) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2016.01.015 · Cited by 171
Consensus Clustering-Based Undersampling Approach to Imbalanced Learning
Onan, A. (2019) · Scientific Programming · doi:10.1155/2019/5901087 · Cited by 164
Self-citation“Term clumping” for technical intelligence: A case study on dye-sensitized solar cells
Zhang, Y., Porter, A. L., Hu, Z., Guo, Y., & Newman, N. C. (2014) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2013.12.019 · Cited by 158
Estimating the number of clusters in a dataset via consensus clustering
Ünlü, R., & Xanthopoulos, P. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.01.074 · Cited by 155
Hybrid hierarchical clustering with applications to microarray data
Chipman, H., & Tibshirani, R. (2005) · Biostatistics · doi:10.1093/biostatistics/kxj007 · Cited by 154
Does deep learning help topic extraction? A kernel k-means clustering method with word embedding
Zhang, Y., Lü, J., Liu, F., Liu, Q., Porter, A. L., Chen, H., & Zhang, G. (2018) · Journal of Informetrics · doi:10.1016/j.joi.2018.09.004 · Cited by 125
Dynamic topic detection and tracking: A comparison of HDP , C‐word, and cocitation methods
Ding, W., & Chen, C. (2014) · Journal of the Association for Information Science and Technology · doi:10.1002/asi.23134 · Cited by 76
Ekbal, A., & Saha, S. (2011) · ACM Transactions on Asian Language Information Processing · doi:10.1145/1967293.1967296 · Cited by 73
Comparison of topic extraction approaches and their results
Velden, T., Boyack, K., Gläser, J., Koopman, R., Scharnhorst, A., & Wang, S.-H. (2017) · Scientometrics · doi:10.1007/s11192-017-2306-1 · Cited by 72
Bashir, S., Qamar, U., & Khan, F. H. (2014) · Quality & Quantity · doi:10.1007/s11135-014-0090-z · Cited by 69
MAPPING OF SCIENCE: POSSIBILITIES AND LIMITATIONS
Rip, A. (1988) · Elsevier eBooks · doi:10.1016/b978-0-444-70537-2.50014-3 · Cited by 69
ADM-LDA: An aspect detection model based on topic modelling using the structure of review sentences
Bagheri, A., Saraee, M. H., & de Jong, F. M. G. (2014) · Journal of Information Science · doi:10.1177/0165551514538744 · Cited by 63
Ten challenges in modeling bibliographic data for bibliometric analysis
Ferrara, A., & Salini, S. (2012) · Scientometrics · doi:10.1007/s11192-012-0810-x · Cited by 45
Content Tree Word Embedding for document representation
Kamkarhaghighi, M., & Makrehchi, M. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.08.021 · Cited by 44
Lauren, P., Qu, G., Zhang, F., & Lendasse, A. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.01.117 · Cited by 38
From Image to Text Classification: A Novel Approach based on Clustering Word Embeddings
Butnaru, A. M., & Ionescu, R. T. (2017) · Procedia Computer Science · doi:10.1016/j.procs.2017.08.211 · Cited by 22
Cited by
Sentiment analysis on product reviews based on weighted word embeddings and deep neural networks
Onan, A. (2021) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.5909 · Cited by 396
Self-citationOnan, A., & Tocoglu, M. A. (2021) · IEEE Access · doi:10.1109/access.2021.3049734 · Cited by 347
Self-citationA Review on Explainability in Multimodal Deep Neural Nets
Joshi, G., Walambe, R., & Kotecha, K. (2021) · IEEE Access · doi:10.1109/access.2021.3070212 · Cited by 204
Metadata
- Authors
- Onan, A.
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 145614-145633
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2979750067
- Cited by
- 257
- References
- 46
- FWCI
- 14.16
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.