使用图论度量研究维基百科数学基本页面

Sajidah Mahmood
{"title":"使用图论度量研究维基百科数学基本页面","authors":"Sajidah Mahmood","doi":"10.15849/ijasca.220328.10","DOIUrl":null,"url":null,"abstract":"Abstract COVID-19 pandemic enforced students in schools and universities all around the world to study using the online and blinded learning. In these learning models, students depend on the Internet for information searching of different scientific essentials to improve their skills and to overcome the gap of facing instructors. One of the most popular sources of information is Wikipedia. In this work, we attempt to study the relations of different math essential pages of Wikipedia to find the relation between these topics. A graph has been constructed for these pages. The graph theoretical metrics, such as, centrality, edge weights and clustering coefficient have been extracted of the constructed graph. The extracted values have been investigated to gain more insights of the math topics that should be studied first. The extracted results show that the in-degree property of the articles and the betweenness value of these articles are correlated. Moreover, there is no relation between the in /out-degree of the pages. Finally, the constructed graph has a small average shortest path and a high global cluster coefficient. This proves that the constructed graph follows the small world phenomenon. Keywords: Graph metrics, Math essentials, Gephi, Small world phenomenon, Directed graph","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"100 11","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Studying the Wikipedia Math Essential Pages using Graph Theory Metrics\",\"authors\":\"Sajidah Mahmood\",\"doi\":\"10.15849/ijasca.220328.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract COVID-19 pandemic enforced students in schools and universities all around the world to study using the online and blinded learning. In these learning models, students depend on the Internet for information searching of different scientific essentials to improve their skills and to overcome the gap of facing instructors. One of the most popular sources of information is Wikipedia. In this work, we attempt to study the relations of different math essential pages of Wikipedia to find the relation between these topics. A graph has been constructed for these pages. The graph theoretical metrics, such as, centrality, edge weights and clustering coefficient have been extracted of the constructed graph. The extracted values have been investigated to gain more insights of the math topics that should be studied first. The extracted results show that the in-degree property of the articles and the betweenness value of these articles are correlated. Moreover, there is no relation between the in /out-degree of the pages. Finally, the constructed graph has a small average shortest path and a high global cluster coefficient. This proves that the constructed graph follows the small world phenomenon. Keywords: Graph metrics, Math essentials, Gephi, Small world phenomenon, Directed graph\",\"PeriodicalId\":38638,\"journal\":{\"name\":\"International Journal of Advances in Soft Computing and its Applications\",\"volume\":\"100 11\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Advances in Soft Computing and its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15849/ijasca.220328.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advances in Soft Computing and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15849/ijasca.220328.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

摘要

摘要新冠肺炎疫情迫使世界各地中小学和大学的学生使用在线和盲法学习。在这些学习模式中,学生依靠互联网进行不同科学要素的信息搜索,以提高他们的技能,克服面对导师的差距。维基百科是最受欢迎的信息来源之一。在这项工作中,我们试图研究维基百科不同数学主页的关系,以找到这些主题之间的关系。已经为这些页面构建了一个图表。从构造的图中提取了中心性、边缘权重和聚类系数等图论度量。已经对提取的值进行了调查,以获得对应该首先研究的数学主题的更多见解。提取结果表明,文章的度属性与文章的介数值是相关的。此外,页面的输入/输出程度之间没有关系。最后,构造的图具有较小的平均最短路径和较高的全局聚类系数。这证明了所构造的图遵循小世界现象。关键词:图度量,数学要素,Gephi,小世界现象,有向图
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Studying the Wikipedia Math Essential Pages using Graph Theory Metrics
Abstract COVID-19 pandemic enforced students in schools and universities all around the world to study using the online and blinded learning. In these learning models, students depend on the Internet for information searching of different scientific essentials to improve their skills and to overcome the gap of facing instructors. One of the most popular sources of information is Wikipedia. In this work, we attempt to study the relations of different math essential pages of Wikipedia to find the relation between these topics. A graph has been constructed for these pages. The graph theoretical metrics, such as, centrality, edge weights and clustering coefficient have been extracted of the constructed graph. The extracted values have been investigated to gain more insights of the math topics that should be studied first. The extracted results show that the in-degree property of the articles and the betweenness value of these articles are correlated. Moreover, there is no relation between the in /out-degree of the pages. Finally, the constructed graph has a small average shortest path and a high global cluster coefficient. This proves that the constructed graph follows the small world phenomenon. Keywords: Graph metrics, Math essentials, Gephi, Small world phenomenon, Directed graph
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Advances in Soft Computing and its Applications
International Journal of Advances in Soft Computing and its Applications Computer Science-Computer Science Applications
CiteScore
3.30
自引率
0.00%
发文量
31
期刊介绍: The aim of this journal is to provide a lively forum for the communication of original research papers and timely review articles on Advances in Soft Computing and Its Applications. IJASCA will publish only articles of the highest quality. Submissions will be evaluated on their originality and significance. IJASCA invites submissions in all areas of Soft Computing and Its Applications. The scope of the journal includes, but is not limited to: √ Soft Computing Fundamental and Optimization √ Soft Computing for Big Data Era √ GPU Computing for Machine Learning √ Soft Computing Modeling for Perception and Spiritual Intelligence √ Soft Computing and Agents Technology √ Soft Computing in Computer Graphics √ Soft Computing and Pattern Recognition √ Soft Computing in Biomimetic Pattern Recognition √ Data mining for Social Network Data √ Spatial Data Mining & Information Retrieval √ Intelligent Software Agent Systems and Architectures √ Advanced Soft Computing and Multi-Objective Evolutionary Computation √ Perception-Based Intelligent Decision Systems √ Spiritual-Based Intelligent Systems √ Soft Computing in Industry ApplicationsOther issues related to the Advances of Soft Computing in various applications.
期刊最新文献
Insider Threat Prevention in the US Banking System Cybersecurity Strategies for Safeguarding Customer’s Data and Preventing Financial Fraud in the United States Financial Sectors Multilevel Thresholding Image Segmentation Based-Logarithm Decreasing Inertia Weight Particle Swarm Optimization Improvement on I-Devices Using L-GCNN Classifier for Smart Mosque Simulation Supervised Learning Algorithms for Predicting Customer Churn with Hyperparameter Optimization
×
引用
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