Goto

Collaborating Authors

 Education


Graph sampling for node embedding

arXiv.org Artificial Intelligence

Node embedding is a central topic in graph representation learning. Computational efficiency and scalability can be challenging to any method that requires full-graph operations. We propose sampling approaches to node embedding, with or without explicit modelling of the feature vector, which aim to extract useful information from both the eigenvectors related to the graph Laplacien and the given values associated with the graph.



[100%OFF] Basic Structure Of Computers

#artificialintelligence

This is an Introductory course so please buy it if you are a beginner and you want to know more about how the computer works within. Please go through the free preview video before buying that is the introduction part and others so that you will get an idea about what this course is about. The central processing unit (CPU), input devices, and output devices are the three components that make up the basic structure of a computer system. The Central Processing Unit (CPU) can also be separated into two parts: the control unit (CU) and the arithmetic logic unit (ALU). The basic structure of a computer describes a simple concept: data is entered into the central processing unit using input devices such as a keyboard, mouse, joystick, scanner, secondary storage devices, and so on, and when the central processing unit receives the data from the input devices, it has a pre-programmed set of instructions to follow, and the result of instruction execution is the output.


This AI newsletter is all you need #17

#artificialintelligence

Originally published on Towards AI the World's Leading AI and Technology News and Media Company. If you are building an AI-related product or service, we invite you to consider becoming an AI sponsor. At Towards AI, we help scale AI and technology startups. Let us help you unleash your technology to the masses. Designer was announced this week.


Teachers could give higher marks to GIRLS because they're neater and easier to teach, study finds

Daily Mail - Science & tech

Girls routinely get better grades than boys with'identical competence' because they are neater and easier to teach, a new study has revealed. Researchers from the University of Trento in Italy compared the results of almost 40,000 students aged 15 and 16 for a series of standardised tests. They found that girls are regularly marked more highly than boys, despite being of equal competence. The researchers suggest that teachers may be unconsciously rewarding students exhibiting traditionally female behaviours, such as quietness and neatness, which make teaching easier. Ilaria Lievore, a PhD candidate in Sociology, said: 'There is a strong correlation between having higher grades and desirable educational outcomes, such as gaining admission to good colleges or having a lower probability of dropping out of school.


Deep Bidirectional Language-Knowledge Graph Pretraining

arXiv.org Artificial Intelligence

Pretraining a language model (LM) on text has been shown to help various downstream NLP tasks. Recent works show that a knowledge graph (KG) can complement text data, offering structured background knowledge that provides a useful scaffold for reasoning. However, these works are not pretrained to learn a deep fusion of the two modalities at scale, limiting the potential to acquire fully joint representations of text and KG. Here we propose DRAGON (Deep Bidirectional Language-Knowledge Graph Pretraining), a self-supervised approach to pretraining a deeply joint language-knowledge foundation model from text and KG at scale. Specifically, our model takes pairs of text segments and relevant KG subgraphs as input and bidirectionally fuses information from both modalities. We pretrain this model by unifying two self-supervised reasoning tasks, masked language modeling and KG link prediction. DRAGON outperforms existing LM and LM+KG models on diverse downstream tasks including question answering across general and biomedical domains, with +5% absolute gain on average. In particular, DRAGON achieves notable performance on complex reasoning about language and knowledge (+10% on questions involving long contexts or multi-step reasoning) and low-resource QA (+8% on OBQA and RiddleSense), and new state-of-the-art results on various BioNLP tasks. Our code and trained models are available at https://github.com/michiyasunaga/dragon.


Spoken Dialogue Strategy Focusing on Asymmetric Communication with Android Robots

arXiv.org Artificial Intelligence

Humans are easily conscious of small differences in an android robot's (AR's) behaviors and utterances, resulting in treating the AR as not-human, while ARs treat us as humans. Thus, there exists asymmetric communication between ARs and humans. In our system at Dialogue Robot Competition 2022, this asymmetry was a considerable research target in our dialogue strategy. For example, tricky phrases such as questions related to personal matters and forceful requests for agreement were experimentally used in AR's utterances. We assumed that these AR phrases would have a reasonable chance of success, although humans would likely hesitate to use the phrases. Additionally, during a five-minute dialogue, our AR's character, such as its voice tones and sentence expressions, changed from mechanical to human-like type in order to pretend to tailor to customers. The characteristics of the AR developed by our team, DSML-TDU, are introduced in this paper.


DAGKT: Difficulty and Attempts Boosted Graph-based Knowledge Tracing

arXiv.org Artificial Intelligence

In the field of intelligent education, knowledge tracing (KT) has attracted increasing attention, which estimates and traces students' mastery of knowledge concepts to provide high-quality education. In KT, there are natural graph structures among questions and knowledge concepts so some studies explored the application of graph neural networks (GNNs) to improve the performance of the KT models which have not used graph structure. However, most of them ignored both the questions' difficulties and students' attempts at questions. Actually, questions with the same knowledge concepts have different difficulties, and students' different attempts also represent different knowledge mastery. In this paper, we propose a difficulty and attempts boosted graph-based KT (DAGKT), using rich information from students' records. Moreover, a novel method is designed to establish the question similarity relationship inspired by the F1 score. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed DAGKT.


Swarm Analytics: Designing Information Markers to Characterise Swarm Systems in Shepherding Contexts

arXiv.org Artificial Intelligence

Contemporary swarm indicators are often used in isolation, focused on extracting information at the individual or collective levels. Consequently, these are seldom integrated to infer a top-level operating picture of the swarm, its members, and its overall collective dynamics. The primary contribution of this paper is to organise a suite of indicators about swarms into an ontologically-arranged collection of information markers to characterise the swarm from the perspective of an external observer\textemdash, a recognition agent. Our contribution shows the foundations for a new area of research that we tile swarm analytics, whose primary concern is with the design and organisation of collections of swarm markers to understand, detect, recognise, track, and learn a particular insight about a swarm system. We present our designed framework of information markers that offer a new avenue for swarm research, especially for heterogeneous and cognitive swarms that may require more advanced capabilities to detect agencies and categorise agent influences and responses.


Using Deep Learning to Find the Next Unicorn: A Practical Synthesis

arXiv.org Artificial Intelligence

Startups often represent newly established business models associated with disruptive innovation and high scalability. They are commonly regarded as powerful engines for economic and social development. Meanwhile, startups are heavily constrained by many factors such as limited financial funding and human resources. Therefore the chance for a startup to eventually succeed is as rare as ``spotting a unicorn in the wild''. Venture Capital (VC) strives to identify and invest in unicorn startups during their early stages, hoping to gain a high return. To avoid entirely relying on human domain expertise and intuition, investors usually employ data-driven approaches to forecast the success probability of startups. Over the past two decades, the industry has gone through a paradigm shift moving from conventional statistical approaches towards becoming machine-learning (ML) based. Notably, the rapid growth of data volume and variety is quickly ushering in deep learning (DL), a subset of ML, as a potentially superior approach in terms capacity and expressivity. In this work, we carry out a literature review and synthesis on DL-based approaches, covering the entire DL life cycle. The objective is a) to obtain a thorough and in-depth understanding of the methodologies for startup evaluation using DL, and b) to distil valuable and actionable learning for practitioners. To the best of our knowledge, our work is the first of this kind.