基于层次分析法的有向无环图多类支持向量机校园电子投诉文档分类

I. Cholissodin, Maya Kurniawati, Indriati, Issa Arwani
{"title":"基于层次分析法的有向无环图多类支持向量机校园电子投诉文档分类","authors":"I. Cholissodin, Maya Kurniawati, Indriati, Issa Arwani","doi":"10.1109/ICACSIS.2014.7065835","DOIUrl":null,"url":null,"abstract":"E-Complaint documents provide information that can be used to measure or evaluate the services that given by campus to its students, lecturers, staff, and public. Using text classification, the documents can be classified based on its importance and urgency. This classification will be useful for campus to make the services better. Classifying the documents can also make the complaints follow-up from campus become faster than before. This paper discussed Directed Acyclic Graph Support Vector Machine (DAGSVM) method based on Analytic Hierarchy Process (AHP) to classify E-Complaint documents into four classes based on the importance and urgecy. Highest accuracy that is obtained from this research is 82,61% with Sequential Training SVM parameters are λ = 0.5, constant of γ = 0.01, Maxiter = 10, and ε = 0.00001, training data 70%, using stemming, and Gaussian RBF kernel without using AHP weight.","PeriodicalId":443250,"journal":{"name":"2014 International Conference on Advanced Computer Science and Information System","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Classification of campus e-complaint documents using Directed Acyclic Graph Multi-class SVM based on analytic hierarchy process\",\"authors\":\"I. Cholissodin, Maya Kurniawati, Indriati, Issa Arwani\",\"doi\":\"10.1109/ICACSIS.2014.7065835\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"E-Complaint documents provide information that can be used to measure or evaluate the services that given by campus to its students, lecturers, staff, and public. Using text classification, the documents can be classified based on its importance and urgency. This classification will be useful for campus to make the services better. Classifying the documents can also make the complaints follow-up from campus become faster than before. This paper discussed Directed Acyclic Graph Support Vector Machine (DAGSVM) method based on Analytic Hierarchy Process (AHP) to classify E-Complaint documents into four classes based on the importance and urgecy. Highest accuracy that is obtained from this research is 82,61% with Sequential Training SVM parameters are λ = 0.5, constant of γ = 0.01, Maxiter = 10, and ε = 0.00001, training data 70%, using stemming, and Gaussian RBF kernel without using AHP weight.\",\"PeriodicalId\":443250,\"journal\":{\"name\":\"2014 International Conference on Advanced Computer Science and Information System\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Advanced Computer Science and Information System\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACSIS.2014.7065835\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Advanced Computer Science and Information System","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACSIS.2014.7065835","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

电子投诉文件提供的信息可用于衡量或评估校园为学生、讲师、员工和公众提供的服务。利用文本分类法,可以根据文件的重要性和紧迫性对文件进行分类。这种分类将有助于校园更好地提供服务。对文件进行分类还可以使校园投诉的后续处理速度比以前更快。本文讨论了基于层次分析法(AHP)的有向无环图支持向量机(DAGSVM)方法,将电子投诉文件根据重要性和紧迫性分为四类。在序列训练支持向量机参数λ = 0.5,常数γ = 0.01, Maxiter = 10, ε = 0.00001,训练数据70%,使用词干提取,使用高斯RBF核,不使用AHP权值的情况下,本研究获得的最高准确率为82.61%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Classification of campus e-complaint documents using Directed Acyclic Graph Multi-class SVM based on analytic hierarchy process
E-Complaint documents provide information that can be used to measure or evaluate the services that given by campus to its students, lecturers, staff, and public. Using text classification, the documents can be classified based on its importance and urgency. This classification will be useful for campus to make the services better. Classifying the documents can also make the complaints follow-up from campus become faster than before. This paper discussed Directed Acyclic Graph Support Vector Machine (DAGSVM) method based on Analytic Hierarchy Process (AHP) to classify E-Complaint documents into four classes based on the importance and urgecy. Highest accuracy that is obtained from this research is 82,61% with Sequential Training SVM parameters are λ = 0.5, constant of γ = 0.01, Maxiter = 10, and ε = 0.00001, training data 70%, using stemming, and Gaussian RBF kernel without using AHP weight.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Model prediction for accreditation of public junior high school in Bogor using spatial decision tree Campaign 2.0: Analysis of social media utilization in 2014 Jakarta legislative election Performance of robust two-dimensional principal component for classification Extending V-model practices to support SRE to build secure web application A comparison of backpropagation and LVQ: A case study of lung sound recognition
×
引用
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