.png){kind=icon}
返回
Optimized combinatorial clustering for stochastic processes
.png){kind=icon}
OA
AI
DOI：10.1007/s10586-017-0763-1.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As a new data processing era like Big Data, Cloud Computing, and Internet of Things approaches, the amount of data being collected in databases far exceeds the ability to reduce and analyze these data without the use of automated analysis techniques, data mining. As the importance of data mining has grown, one of the critical issues to emerge is how to scale data mining techniques to larger and complex databases so that it is particularly imperative for computationally intensive data mining tasks such as identifying natural clusters of instances. In this paper, we suggest an optimized combinatorial clustering algorithm for noisy performance which is essential for large data with random sampling. The algorithm outperforms conventional approaches through various numerical and qualitative thresholds like mean and standard deviation of accuracy and computation speed.
Keyword:
Nested partitions method
Optimized combinatorial clustering algorithm
Data clustering
Stochastic process
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.1
论文数:
5.0K
被引数:
7.5K
机构
引用论文
Density-matrix based numerical methods for discovering order and correlations in interacting systemsOAAI
.png){kind=icon}
OAAI分享收藏Explicit instruction through task repetition: effects on explicit and implicit knowledge development
PREAI
分享收藏分享收藏
查看更多内容