跨领域非结构化文本本体构建与知识图谱

Shital Kakad, Sudhir Dhage
{"title":"跨领域非结构化文本本体构建与知识图谱","authors":"Shital Kakad, Sudhir Dhage","doi":"10.1109/ASIANCON55314.2022.9908942","DOIUrl":null,"url":null,"abstract":"Ontology construction takes a lot of effort and time. Semantic web extract accurate knowledge from large databases. In this paper, an ontology construction process is proposed for cross domain data. The amazon and flip kart reviews are taken to construct ontology for unstructured text data . The data is pre-processed to clean and remove noise. The combined approach of cosine similarity and TF-IDF has been used to find similarity. Further, K means clustering is applied to identify topics. The hierarchical clustering is implemented to represent ontology. The accuracy, precision and recall are calculated by applying different classifier algorithms like Decision Tree Classifier, Gaussian NB, Random Forest Classifier, Support vector classifier and, K Neighbors Classifier. Support vector classifiers show excellent results comparative to other classifier algorithms. Support vector classifier performance shows accuracy - 0.70%, precision- 0.83% , recall- 0.70% and F1-score - 0.73%.","PeriodicalId":429704,"journal":{"name":"2022 2nd Asian Conference on Innovation in Technology (ASIANCON)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ontology Construction and Knowledge Graph for Cross Domain Unstructured Text\",\"authors\":\"Shital Kakad, Sudhir Dhage\",\"doi\":\"10.1109/ASIANCON55314.2022.9908942\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ontology construction takes a lot of effort and time. Semantic web extract accurate knowledge from large databases. In this paper, an ontology construction process is proposed for cross domain data. The amazon and flip kart reviews are taken to construct ontology for unstructured text data . The data is pre-processed to clean and remove noise. The combined approach of cosine similarity and TF-IDF has been used to find similarity. Further, K means clustering is applied to identify topics. The hierarchical clustering is implemented to represent ontology. The accuracy, precision and recall are calculated by applying different classifier algorithms like Decision Tree Classifier, Gaussian NB, Random Forest Classifier, Support vector classifier and, K Neighbors Classifier. Support vector classifiers show excellent results comparative to other classifier algorithms. Support vector classifier performance shows accuracy - 0.70%, precision- 0.83% , recall- 0.70% and F1-score - 0.73%.\",\"PeriodicalId\":429704,\"journal\":{\"name\":\"2022 2nd Asian Conference on Innovation in Technology (ASIANCON)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 2nd Asian Conference on Innovation in Technology (ASIANCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASIANCON55314.2022.9908942\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 2nd Asian Conference on Innovation in Technology (ASIANCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASIANCON55314.2022.9908942","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

构建本体需要花费大量的精力和时间。语义网从大型数据库中提取准确的知识。提出了一种面向跨领域数据的本体构建方法。采用amazon和flip kart评论来构建非结构化文本数据的本体。对数据进行预处理,去除噪声。利用余弦相似度和TF-IDF相结合的方法来寻找相似度。此外,K均值聚类应用于识别主题。实现了层次聚类来表示本体。采用不同的分类器算法,如决策树分类器、高斯NB、随机森林分类器、支持向量分类器和K近邻分类器,计算准确率、精密度和召回率。与其他分类器算法相比,支持向量分类器表现出优异的分类效果。支持向量分类器的准确率为0.70%,精密度为0.83%,召回率为0.70%,F1-score为0.73%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Ontology Construction and Knowledge Graph for Cross Domain Unstructured Text
Ontology construction takes a lot of effort and time. Semantic web extract accurate knowledge from large databases. In this paper, an ontology construction process is proposed for cross domain data. The amazon and flip kart reviews are taken to construct ontology for unstructured text data . The data is pre-processed to clean and remove noise. The combined approach of cosine similarity and TF-IDF has been used to find similarity. Further, K means clustering is applied to identify topics. The hierarchical clustering is implemented to represent ontology. The accuracy, precision and recall are calculated by applying different classifier algorithms like Decision Tree Classifier, Gaussian NB, Random Forest Classifier, Support vector classifier and, K Neighbors Classifier. Support vector classifiers show excellent results comparative to other classifier algorithms. Support vector classifier performance shows accuracy - 0.70%, precision- 0.83% , recall- 0.70% and F1-score - 0.73%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信