تعداد نشریات | 418 |
تعداد شمارهها | 10,005 |
تعداد مقالات | 83,621 |
تعداد مشاهده مقاله | 78,332,216 |
تعداد دریافت فایل اصل مقاله | 55,378,413 |
Wised Semi-Supervised Cluster Ensemble Selection: A New Framework for Selecting and Combing Multiple Partitions Based on Prior knowledge | ||
Journal of Advances in Computer Research | ||
مقاله 33، دوره 8، شماره 1 - شماره پیاپی 27، اردیبهشت 2017، صفحه 67-88 اصل مقاله (1.27 M) | ||
نوع مقاله: Original Manuscript | ||
نویسندگان | ||
Fozieh Asghari Paeenroodposhti* 1؛ Saber Nourian2؛ Muhammad Yousefnezhad3 | ||
1Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran | ||
2Department of Electrical Engineering, Sari Branch, Islamic Azad University, Sari, Iran | ||
3College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China | ||
چکیده | ||
The Wisdom of Crowds, an innovative theory described in social science, claims that the aggregate decisions made by a group will often be better than those of its individual members if the four fundamental criteria of this theory are satisfied. This theory used for in clustering problems. Previous researches showed that this theory can significantly increase the stability and performance of learning problems. As a solution, this paper proposes a new methodology of using WOC theory for evaluating and selecting basic result partitions in semi-supervised clustering problems. This paper introduces new technique for reducing the data dimensions based on supervision information, a new semi-supervised clustering algorithm based on k-means for generating basic results, a new strategy for evaluating and selecting basic results based on feedback mechanism, a new metric for evaluating diversity of basic results. The results demonstrate the efficiency of proposed method's aggregate decision-making compared to other algorithms. | ||
کلیدواژهها | ||
Semi-Supervised Learning؛ Cluster Ensemble Selection؛ Wisdom of Crowds؛ Pairwise Constraints؛ Constraint Projection | ||
آمار تعداد مشاهده مقاله: 1,605 تعداد دریافت فایل اصل مقاله: 24,132 |