Text Mining for Internship Titles Clustering Using Shared Nearest Neighbor

L. Zahrotun
{"title":"Text Mining for Internship Titles Clustering Using Shared Nearest Neighbor","authors":"L. Zahrotun","doi":"10.18495/comengapp.v6i3.214","DOIUrl":null,"url":null,"abstract":"An Internship course becomes one of many compulsory subjects in Under graduate Program of Informatics Engineering in Ahmad Dahlan University, Yogyakarta.In the last few semesters, we found that some students were failed in taking this subject. After being identified, they were facing some obstacles such as determining the main theme for their job description. During this study, we proposed an application to classify the internship titles by using a technique in text mining called Shared Nearest-Neighbor and Cosine Similarity. From the result, we got values from the parameter K is 7, the epsilon value is 0.5, and the value of Mint t is 0.3 with 22 clusters and 0 outlier. These values presented that all data titles of internship activitiesareclassified into each cluster. 7 topics whichtook by majority of students are:1) Information Systems (7 titles);2) Instructional Media (5 titles);3)Archiving Applications (4 titles);4) Web Profile Implementation (3 titles); 5)Instructional Media for University Courses (3 titles); Multimedia (3 titles) and 6)Workshop & Training (3 titles).","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Engineering and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18495/comengapp.v6i3.214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

An Internship course becomes one of many compulsory subjects in Under graduate Program of Informatics Engineering in Ahmad Dahlan University, Yogyakarta.In the last few semesters, we found that some students were failed in taking this subject. After being identified, they were facing some obstacles such as determining the main theme for their job description. During this study, we proposed an application to classify the internship titles by using a technique in text mining called Shared Nearest-Neighbor and Cosine Similarity. From the result, we got values from the parameter K is 7, the epsilon value is 0.5, and the value of Mint t is 0.3 with 22 clusters and 0 outlier. These values presented that all data titles of internship activitiesareclassified into each cluster. 7 topics whichtook by majority of students are:1) Information Systems (7 titles);2) Instructional Media (5 titles);3)Archiving Applications (4 titles);4) Web Profile Implementation (3 titles); 5)Instructional Media for University Courses (3 titles); Multimedia (3 titles) and 6)Workshop & Training (3 titles).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于共享最近邻的实习职称聚类文本挖掘
实习课程成为日惹Ahmad Dahlan大学资讯工程本科课程的必修科目之一。在过去的几个学期里,我们发现一些学生这门课不及格。在被确定之后,他们面临着一些障碍,比如确定他们的工作描述的主题。在本研究中,我们提出了一种应用程序,通过使用文本挖掘中的共享近邻和余弦相似度技术对实习标题进行分类。从结果中,我们得到参数K的值为7,epsilon的值为0.5,Mint的值为0.3,有22个簇和0个离群值。这些值表示实习活动的所有数据标题都被分类到每个聚类中。大多数学生选择的7个主题是:1)信息系统(7个标题);2)教学媒体(5个标题);3)归档应用程序(4个标题);4)Web Profile实现(3个标题);5)大学课程教学媒体(3篇);多媒体(3个标题)和6)研讨会与培训(3个标题)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fuzzy Logic-Ant Colony Optimization for Explorer-Follower Robot with Global Optimal Path Planning BLOB Analysis for Fruit Recognition and Detection Some Physical and Computational Features of Unloaded Power Transmission Lines' Switching-off Process A new method to improve feature selection with meta-heuristic algorithm and chaos theory Implementation Color Filtering and Harris Corner Method on Pattern Recognition System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1