GBK-means clustering algorithm: An improvement to the K-means algorithm based on the bargaining game

MJ Rezaee, M Eshkevari, M Saberi… - Knowledge-Based Systems, 2021 - Elsevier
Due to its simplicity, versatility and the diversity of applications to which it can be applied, k-
means is one of the well-known algorithms for clustering data. The foundation of this …

An effective algorithm based on density clustering framework

J Lu, Q Zhu - Ieee Access, 2017 - ieeexplore.ieee.org
Clustering analysis has the very broad applications on data analysis, such as data mining,
machine learning, and information retrieval. In practice, most of clustering algorithms suffer …

Forecasting bus passenger flows by using a clustering-based support vector regression approach

C Li, X Wang, Z Cheng, Y Bai - Ieee Access, 2020 - ieeexplore.ieee.org
As a significant component of the intelligent transportation system, forecasting bus
passenger flows plays a key role in resource allocation, network planning, and frequency …

Evaluation and prediction of hydraulic fractured well performance in Montney Formations using a data-driven approach

S Wang, S Chen - SPE Western Regional Meeting, 2016 - onepetro.org
The Montney tight formation, located in Western Canadian Sedimentary Basin (WCSB), is
becoming an important component of hydrocarbon sources in Canada. Horizontal drilling …

Modified sequential k‐means clustering by utilizing response: A case study for fashion products

A Fallah Tehrani, D Ahrens - Expert Systems, 2017 - Wiley Online Library
Modified sequential k‐means clustering concerns ak‐means clustering problem in which the
clustering machine utilizes output similarity in addition. While conventional clustering …

Scalable clustering by truncated fuzzy -means

G Gan, Q Lan, S Sima - Big Data & Information Analytics, 2016 - aimsciences.org
Most existing clustering algorithms are slow for dividing a large dataset into a large number
of clusters. In this paper, we propose a truncated FCM algorithm to address this problem …

[PDF][PDF] 基于子博弈完美均衡的启发式聚类算法

常璐瑶, 牛新征, 罗涛, 钱早国 - 电子学报, 2024 - ejournal.org.cn
聚类是一种典型且重要的数据挖掘方法, 但现有聚类算法大多需要人为指定聚类的数量,
并且聚类结果对参数敏感. 针对上述不足, 本文提出一种基于子博弈完美均衡的启发式聚类算法 …

Enhanced subspace clustering through combining Minkowski distance and Cosine dissimilarity

L Jin, X Zhi, S Zhao - Journal of Intelligent & Fuzzy Systems, 2018 - content.iospress.com
In view of intelligent Minkowski metric Weighted K-means (iMWK) sensitive to feature
weighting, a novel clustering technique called intelligent Minkowski metric feature weights …

Adaptive density distribution inspired affinity propagation clustering

Z Fan, J Jiang, S Weng, Z He, Z Liu - Neural Computing and Applications, 2019 - Springer
As an effective clustering method, Affinity Propagation (AP) has received extensive
attentions. But its applications are seriously limited by two major deficiencies. Firstly, the …

Querying informative constraints for data clustering: An embedding approach

AA Abin - Applied Soft Computing, 2019 - Elsevier
Querying high quality constraints for clustering is a difficult task in clustering research due to
the lack of an appropriate criterion for measuring the quality of constraints. In this paper, we …