.png){kind=icon}
返回
A multi-block clustering algorithm for high dimensional binarized sparse data
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2021.116219.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce a multidimensional multiblock clustering (MDMBC) algorithm in this paper. MDMBC can generate overlapping clusters with similar values along clusters of dimensions. The parsimonious binary vector representation of multidimensional clusters lends itself to the application of efficient meta-heuristic optimization algorithms. In this paper, a hill-climbing (HC) greedy search algorithm has been presented that can be extended by several stochastic and population-based meta-heuristic frameworks. The benefits of the algorithm are demonstrated in a bi-clustering benchmark problem and in the analysis of the Leiden higher education ranking system, which measures the scientific performance of 903 institutions along four dimensions of 20 indicators representing publication output and collaboration in different scientific fields and time periods.
Keyword:
Multidimensional clustering
High dimensional data
Ranking
Higher educational institutes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
Biclustering: Overcoming Data Dimensionality Problems in Market Segmentation双聚类: 克服市场细分中的数据维度问题
PREAI
分享收藏More time for judo matches? Analysis of type of techniques, time, scores, and penalties in the Tokyo 2020 Olympic Games更多时间进行柔道比赛？东京2020奥运会技术类型、时间、得分和处罚分析OAAI
OAAI分享收藏
查看更多内容