首页> 外文期刊>Jurnal Teknologi dan Manajemen Informatika >IMPLEMENTASI K-MEANS KLUSTERING UNTUK REKOMENDASI TEMA TUGAS AKHIR PADA STMIK ASIA MALANG
【24h】

IMPLEMENTASI K-MEANS KLUSTERING UNTUK REKOMENDASI TEMA TUGAS AKHIR PADA STMIK ASIA MALANG

机译:在亚洲玛琅STMIK中建议最终项目主题的K均值聚类的实现

获取原文
           

摘要

Each student who attended the lecture at a college will inevitably undergo thesis examination or final project to finish the S1 degree. However, students still often have difficulty in determining the title theme to be lifted. On the other hand, many students take random theme of the thesis title or final project, just following friends or colleagues or looking for a single reference from the library. Therefore, it takes a process of data mining to assist students in determining the proper final assignment theme. The process of data mining is done by using K-Means algorithm with input value sudentscourses that have reached as the determining aspect, so that it found a pattern of students interest which is used to recommended themin determining the final project or thesis theme that suits their ability. In its application, classification as done against the final project themes were divided into 7 groups/clusters. Using students score as the input, the process is done using the K-Means algorithm by taking into account distance between data ti the center cluster (centroid). So that there is no more data move to the other cluster. Based on the testing against the centroid for 15 times, obtained a result that second centroid has the highest truth compared to other centroid with the value was 90.24%. Therefore, the system will use the second centroid as a new reference in determining the theme of the final project for each student by viewing the closest data to the centroid point.
机译:每位在大学里上课的学生都将不可避免地接受论文考试或最终项目以完成S1学位。但是,学生仍然常常难以确定要取消的标题主题。另一方面,许多学生只是跟随朋友或同事,或从图书馆中寻找单个参考文献,随机选择论文题目或最终项目的主题。因此,需要一个数据挖掘过程来帮助学生确定正确的最终作业主题。数据挖掘的过程是通过使用K-Means算法完成的,其中输入值的学习课程已经达到了决定性的方面,因此它发现了一个学生兴趣模式,用于推荐最适合自己的最终项目或论文主题的人。能力。在应用中,根据最终项目主题进行的分类分为7个组/集群。使用学生得分作为输入,通过考虑中心簇(质心)之间的数据之间的距离,使用K-Means算法完成该过程。这样就不再有数据移动到另一个群集。通过对质心进行15次测试,得出第二质心与其他质心相比真实性最高的结果,值为90.24%。因此,系统将通过查看最接近质心点的数据,使用第二个质心作为新参考,从而为每个学生确定最终项目的主题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号