scholarly journals A Knowledge Graph Based Approach to Social Science Surveys

2021 ◽  
pp. 1-26
Author(s):  
Jeff Z. Pan ◽  
Elspeth Edelstein ◽  
Patrik Bansky ◽  
Adam Wyner
Keyword(s):  
Social Science ◽  
Open Science ◽  
Knowledge Graph ◽  
Dynamic Component ◽  
Face To Face ◽  
Recent Success ◽  
Equivalent Length ◽  
Survey System ◽  
Knowledge Graphs ◽  
Primary Advantage

Abstract Recent success of knowledge graphs has spurred interest in applying knowledge graphs in open science, such as on intelligent survey systems for scientists. However, efforts to understand the quality of candidate survey questions provided by these methods have been limited. Indeed, existing methods do not consider the type of on-the-fly content planning that is possible for face-to-face surveys and hence do not guarantee that selection of subsequent questions is based on response to previous questions in a survey. To address this limitation, we propose a dynamic and informative solution for an intelligent survey system that is based on knowledge graphs. To illustrate our proposal, we look into social science surveys, focusing on ordering the questions of a questionnaire component by their level of acceptance, along with conditional triggers that further customise participants’ experience. Our main findings are: (i) evaluation of the proposed approach shows that the dynamic component can be beneficial in terms of lowering the number of questions asked per variable, thus allowing more informative data to be collected in a survey of equivalent length; and (ii) a primary advantage of the proposed approach is that it enables grouping of participants according to their responses, so that participants are not only served appropriate follow-up questions, but their responses to these questions may be analysed in the context of some initial categorisation. We believe that the proposed approach can easily be applied to other social science surveys based on grouping definitions in their contexts. The knowledge-graph-based intelligent survey approach proposed in our work allows online questionnaires to approach face-to-face interaction in their level of informativity and responsiveness, as well as duplicating certain advantages of interview-based data collection.

Mobile Software Assurance Informed through Knowledge Graph Construction: The OWASP Threat of Insecure Data Storage

2020 ◽  
Vol 2 (2) ◽  
Author(s):  
Suzanna Schmeelk ◽  
Lixin Tao
Keyword(s):  
Data Storage ◽  
Program Analysis ◽  
Web Application ◽  
Security Analysis ◽  
Knowledge Graph ◽  
Healthcare Applications ◽  
Sensitive Data ◽  
Knowledge Graphs ◽  
Mobile Malware Detection ◽  
Software Assurance

Many organizations, to save costs, are movinheg to t Bring Your Own Mobile Device (BYOD) model and adopting applications built by third-parties at an unprecedented rate.  Our research examines software assurance methodologies specifically focusing on security analysis coverage of the program analysis for mobile malware detection, mitigation, and prevention.  This research focuses on secure software development of Android applications by developing knowledge graphs for threats reported by the Open Web Application Security Project (OWASP).  OWASP maintains lists of the top ten security threats to web and mobile applications.  We develop knowledge graphs based on the two most recent top ten threat years and show how the knowledge graph relationships can be discovered in mobile application source code.  We analyze 200+ healthcare applications from GitHub to gain an understanding of their software assurance of their developed software for one of the OWASP top ten moble threats, the threat of “Insecure Data Storage.”  We find that many of the applications are storing personally identifying information (PII) in potentially vulnerable places leaving users exposed to higher risks for the loss of their sensitive data.

scholarly journals TransET: Knowledge Graph Embedding with Entity Types

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1407
Author(s):  
Peng Wang ◽  
Jing Zhou ◽  
Yuzhang Liu ◽  
Xingchen Zhou
Keyword(s):  
Link Prediction ◽  
State Of The Art ◽  
Score Function ◽  
Graph Embedding ◽  
Vector Spaces ◽  
Knowledge Graph ◽  
Semantic Features ◽  
Knowledge Graphs ◽  
Real World Datasets ◽  
Low Dimensional

Knowledge graph embedding aims to embed entities and relations into low-dimensional vector spaces. Most existing methods only focus on triple facts in knowledge graphs. In addition, models based on translation or distance measurement cannot fully represent complex relations. As well-constructed prior knowledge, entity types can be employed to learn the representations of entities and relations. In this paper, we propose a novel knowledge graph embedding model named TransET, which takes advantage of entity types to learn more semantic features. More specifically, circle convolution based on the embeddings of entity and entity types is utilized to map head entity and tail entity to type-specific representations, then translation-based score function is used to learn the presentation triples. We evaluated our model on real-world datasets with two benchmark tasks of link prediction and triple classification. Experimental results demonstrate that it outperforms state-of-the-art models in most cases.

scholarly journals Development of Knowledge Graph for Data Management Related to Flooding Disasters Using Open Data

2021 ◽  
Vol 13 (5) ◽  
pp. 124
Author(s):  
Jiseong Son ◽  
Chul-Su Lim ◽  
Hyoung-Seop Shim ◽  
Ji-Sun Kang
Keyword(s):  
Artificial Intelligence ◽  
Domain Knowledge ◽  
Open Data ◽  
Heterogeneous Data ◽  
Big Data Analysis ◽  
Knowledge Graph ◽  
Cross Domain ◽  
Disaster Data ◽  
Knowledge Graphs ◽  
Open Datasets

Despite the development of various technologies and systems using artificial intelligence (AI) to solve problems related to disasters, difficult challenges are still being encountered. Data are the foundation to solving diverse disaster problems using AI, big data analysis, and so on. Therefore, we must focus on these various data. Disaster data depend on the domain by disaster type and include heterogeneous data and lack interoperability. In particular, in the case of open data related to disasters, there are several issues, where the source and format of data are different because various data are collected by different organizations. Moreover, the vocabularies used for each domain are inconsistent. This study proposes a knowledge graph to resolve the heterogeneity among various disaster data and provide interoperability among domains. Among disaster domains, we describe the knowledge graph for flooding disasters using Korean open datasets and cross-domain knowledge graphs. Furthermore, the proposed knowledge graph is used to assist, solve, and manage disaster problems.

scholarly journals Research of Personalized Recommendation Technology Based on Knowledge Graphs

2021 ◽  
Vol 11 (15) ◽  
pp. 7104
Author(s):  
Xu Yang ◽  
Ziyi Huan ◽  
Yisong Zhai ◽  
Ting Lin
Keyword(s):  
Neural Network ◽  
Hot Spot ◽  
Experimental Results ◽  
Graph Representation ◽  
Personalized Recommendation ◽  
Knowledge Graph ◽  
Learning Technology ◽  
Data Set ◽  
Model Based ◽  
Knowledge Graphs

Nowadays, personalized recommendation based on knowledge graphs has become a hot spot for researchers due to its good recommendation effect. In this paper, we researched personalized recommendation based on knowledge graphs. First of all, we study the knowledge graphs’ construction method and complete the construction of the movie knowledge graphs. Furthermore, we use Neo4j graph database to store the movie data and vividly display it. Then, the classical translation model TransE algorithm in knowledge graph representation learning technology is studied in this paper, and we improved the algorithm through a cross-training method by using the information of the neighboring feature structures of the entities in the knowledge graph. Furthermore, the negative sampling process of TransE algorithm is improved. The experimental results show that the improved TransE model can more accurately vectorize entities and relations. Finally, this paper constructs a recommendation model by combining knowledge graphs with ranking learning and neural network. We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-BPR) and the neural network recommendation model based on knowledge graphs(KG-NN). The semantic information of entities and relations in knowledge graphs is embedded into vector space by using improved TransE method, and we compare the results. The item entity vectors containing external knowledge information are integrated into the BPR model and neural network, respectively, which make up for the lack of knowledge information of the item itself. Finally, the experimental analysis is carried out on MovieLens-1M data set. The experimental results show that the two recommendation models proposed in this paper can effectively improve the accuracy, recall, F1 value and MAP value of recommendation.

scholarly journals Pattern-based design applied to cultural heritage knowledge graphs

Semantic Web ◽  
2020 ◽  
pp. 1-45
Author(s):  
Valentina Anita Carriero ◽  
Aldo Gangemi ◽  
Maria Letizia Mancinelli ◽  
Andrea Giovanni Nuzzolese ◽  
Valentina Presutti ◽  
...  
Keyword(s):  
Cultural Heritage ◽  
Design Patterns ◽  
Lessons Learned ◽  
Knowledge Graph ◽  
Unit Testing ◽  
Domain Specific ◽  
Rigorous Testing ◽  
Ontology Design ◽  
Domain Specific Knowledge ◽  
Knowledge Graphs

Ontology Design Patterns (ODPs) have become an established and recognised practice for guaranteeing good quality ontology engineering. There are several ODP repositories where ODPs are shared as well as ontology design methodologies recommending their reuse. Performing rigorous testing is recommended as well for supporting ontology maintenance and validating the resulting resource against its motivating requirements. Nevertheless, it is less than straightforward to find guidelines on how to apply such methodologies for developing domain-specific knowledge graphs. ArCo is the knowledge graph of Italian Cultural Heritage and has been developed by using eXtreme Design (XD), an ODP- and test-driven methodology. During its development, XD has been adapted to the need of the CH domain e.g. gathering requirements from an open, diverse community of consumers, a new ODP has been defined and many have been specialised to address specific CH requirements. This paper presents ArCo and describes how to apply XD to the development and validation of a CH knowledge graph, also detailing the (intellectual) process implemented for matching the encountered modelling problems to ODPs. Relevant contributions also include a novel web tool for supporting unit-testing of knowledge graphs, a rigorous evaluation of ArCo, and a discussion of methodological lessons learned during ArCo’s development.

scholarly journals A Survey of Techniques for Constructing Chinese Knowledge Graphs and Their Applications

2018 ◽  
Vol 10 (9) ◽  
pp. 3245 ◽  
Author(s):  
Tianxing Wu ◽  
Guilin Qi ◽  
Cheng Li ◽  
Meng Wang
Keyword(s):  
Artificial Intelligence ◽  
Question Answering ◽  
Knowledge Representation And Reasoning ◽  
Knowledge Graph ◽  
Development History ◽  
One Belt One Road ◽  
History Of ◽  
Knowledge Graphs ◽  
The One ◽  
The Impact

With the continuous development of intelligent technologies, knowledge graph, the backbone of artificial intelligence, has attracted much attention from both academic and industrial communities due to its powerful capability of knowledge representation and reasoning. In recent years, knowledge graph has been widely applied in different kinds of applications, such as semantic search, question answering, knowledge management and so on. Techniques for building Chinese knowledge graphs are also developing rapidly and different Chinese knowledge graphs have been constructed to support various applications. Under the background of the “One Belt One Road (OBOR)” initiative, cooperating with the countries along OBOR on studying knowledge graph techniques and applications will greatly promote the development of artificial intelligence. At the same time, the accumulated experience of China in developing knowledge graphs is also a good reference to develop non-English knowledge graphs. In this paper, we aim to introduce the techniques of constructing Chinese knowledge graphs and their applications, as well as analyse the impact of knowledge graph on OBOR. We first describe the background of OBOR, and then introduce the concept and development history of knowledge graph and typical Chinese knowledge graphs. Afterwards, we present the details of techniques for constructing Chinese knowledge graphs, and demonstrate several applications of Chinese knowledge graphs. Finally, we list some examples to explain the potential impacts of knowledge graph on OBOR.

scholarly journals SPECIAL TUTORIAL CLASSES TO UPGRADE LEARNING ACHIEVEMENT OF STUDENTS ENROLLED IN MATHEMATICS FOR SOCIAL SCIENCE AT STOU

2008 ◽  
Vol 3 (2) ◽  
pp. 122-133
Author(s):  
Sakorn Boondao
Keyword(s):  
Social Science ◽  
Cost Effective ◽  
Developed Countries ◽  
Pass Rate ◽  
Final Exam ◽  
Face To Face ◽  
Tutorial Program ◽  
Significant Difference ◽  
Level Scale ◽  
Teaching Programs

Unlike distance education institutions in developed countries Sukhothai Thammathirat Open University makes very limited use of assignments in its teaching programs. The main means of interaction between tutors and students consists of free face-to-face tutorials conducted three times per semester in provincial centers throughout the country. In courses with low enrolments (less than 1000 students) such tutorials have recently been deemed not to be cost effective. Alternative regional or central intensive programs have been developed. These involve 20 hours of tutorial classes and assignment work over two weekends in the final month of the semester and count for 30% of the assessment. A small charge is made for registration. The Mathematics for Social Science course was affected by this change. Since mathematics is a difficult subject for students, (only about 30% normally passed the course) the special tutorial program was used to help students in the second semester of 2006. Students were more interested in this approach than in the regular face-to-face tutorials. After the project was advertised, 98 students applied. While this was more than three times the number who had attended the free tutorials in the previous semester, it was not sufficient to justify tutorials in the four regions. Instead, three classes were conducted in Bangkok. Only 71 of the original applicants attended. During the program the better students were asked to assist those who needed help. Student questionnaires indicated that more than half identified themselves as weak in mathematics, most had completed year 12 and just over three-quarters had never attended regular face-to-face tutorials. They were asked to rank items about the classes on a five-level scale. The availability of up to 30% of the marks for the course was the major attraction. Most indicated that they were pleased with the classes, and gained more knowledge; while assignments, as well as the solutions given after submission, helped them understand the contents. Having classmates help them with learning also encouraged them with their study. They felt that they needed more time to study and do assignment work, and would like more marks to be allocated for the assignments. It was found that the achievement of students who attended the special tutorial classes was significantly higher than that of those who did not. The pass rate in this semester dramatically increased compared to the previous semester, 50.72% and 30.34% respectively. But when comparing students' final exam scores for both groups, it was found that there was no significant difference in the scores. However students were satisfied with these special tutorial classes.

scholarly journals Knowledge Graphs and Network Text Analysis

2003 ◽  
Vol 42 (1) ◽  
pp. 91-106 ◽  
Author(s):  
Roel Popping
Keyword(s):  
Present State ◽  
Text Analysis ◽  
Scientific Theory ◽  
Semantic Network ◽  
Labour Markets ◽  
Knowledge Graph ◽  
Causal Relations ◽  
Network Text Analysis ◽  
Knowledge Graphs

A knowledge graph is a kind of semantic network representing some scientific theory. The article describes the present state of this field and addresses a number of problems that have not yet been solved. These problems are implicit relations, strength of (causal) relations, and exclusiveness. Concepts might be too broad or complex to be used properly, so directions for solving these problems are explored. The solutions are applied to a knowledge graph in the field of labour markets.

scholarly journals MOVIE RECOMMENDATION USING KNOWLEDGE GRAPH

2020 ◽  
pp. 99-103
Author(s):  
Navin Tatyaba Gopal ◽  
Anish Raj Khobragade
Keyword(s):  
Neural Network ◽  
Recommender Systems ◽  
Weighted Graph ◽  
Cold Start ◽  
Structured Data ◽  
Label Propagation ◽  
Knowledge Graph ◽  
Movie Recommendation ◽  
Knowledge Graphs ◽  
Prior Application

The Knowledge graphs (KGs) catches structured data and relationships among a bunch of entities and items. Generally, constitute an attractive origin of information that can advance the recommender systems. But, present methodologies of this area depend on manual element thus don’t permit for start to end training. This article proposes, Knowledge Graph along with Label Smoothness (KG-LS) to offer better suggestions for the recommender Systems. Our methodology processes user-specific entities by prior application of a function capability that recognizes key KG-relationships for a specific user. In this manner, we change the KG in a specific-user weighted graph followed by application of a graph neural network to process customized entity embedding. To give better preliminary predisposition, label smoothness comes into picture, which places items in the KG which probably going to have identical user significant names/scores. Use of, label smoothness gives regularization above the edge weights thus; we demonstrate that it is comparable to a label propagation plan on the graph. Additionally building-up a productive usage that symbolizes solid adaptability concerning the size of knowledge graph. Experimentation on 4 datasets shows that our strategy beats best in class baselines. This process likewise accomplishes solid execution in cold start situations where user-entity communications remain meager.

Sign in / Sign up

Export Citation Format

Share Document