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

Imran Khan 0003

dblp:66/2054-3 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

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
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.412020
Variable Weighting in Fuzzy k-Means Clustering to Determine the Number of Clusters · IEEE Trans. Knowl. Data Eng. 2020
Data mining › clustering › clustering evaluation
cluster number estimation
0.412020
Variable Weighting in Fuzzy k-Means Clustering to Determine the Number of Clusters · IEEE Trans. Knowl. Data Eng. 2020
Data mining › clustering
fuzzy clustering
0.412020
Variable Weighting in Fuzzy k-Means Clustering to Determine the Number of Clusters · IEEE Trans. Knowl. Data Eng. 2020

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

penalty term · 0.4iterative variable weight update · 0.4fuzzy k-means · 0.4
YearPublicationVenuePosition
2020 Variable Weighting in Fuzzy k-Means Clustering to Determine the Number of Clusters
abstract
One of the most significant problems in cluster analysis is to determine the number of clusters in unlabeled data, which is the input for most clustering algorithms. Some methods have been developed to address this problem. However, little attention has been paid on algorithms that are insensitive to the initialization of cluster centers and utilize variable weights to recover the number of clusters. To fill this gap, we extend the standard fuzzy k-means clustering algorithm. It can automatically determine the number of clusters by iteratively calculating the weights of all variables and the membership value of each object in all clusters. Two new steps are added to the fuzzy k-means clustering process. One of them is to introduce a penalty term to make the clustering process insensitive to the initial cluster centers. The other one is to utilize a formula for iterative updating of variable weights in each cluster based on the current partition of data. Experimental results on real-world and synthetic datasets have shown that the proposed algorithm effectively determined the correct number of clusters while initializing the different number of cluster centroids. We also tested the proposed algorithm on gene data to determine a subset of important genes.
Imran Khan 0003, Zongwei Luo, Joshua Zhexue Huang, Waseem Shahzad
IEEE Trans. Knowl. Data Eng.1
2016 Incremental density-based ensemble clustering over evolving data streams
Imran Khan 0003, Joshua Zhexue Huang, Kamen Ivanov
Neurocomputing1