{"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}
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%.