|
|
|
|
|
Naoko Nitta, Kazuaki Nakamura and Noboru Babaguchi
While visual appearances play a main role in recognizing the concepts captured in images, additional information can provide complementary information for fine-grained image recognition, where concepts with similar visual appearances such as species of b...
ver más
|
|
|
|
|
|
|
|
|
|
|
Eli Levine and J. S. Butler
Determining what constitutes a causal relationship between two or more concepts, and how to infer causation, are fundamental concepts in statistics and all the sciences. Causation becomes especially difficult in the social sciences where there is a myria...
ver más
|
|
|
|
|
|
|
|
|
|
|
Eli Levine and J. S. Butler
|
|
|
|
|
|
|
|
|
|
|
Qurat Ul Ain, Mohamed Amine Chatti, Komlan Gluck Charles Bakar, Shoeb Joarder and Rawaa Alatrash
Knowledge graphs (KGs) are widely used in the education domain to offer learners a semantic representation of domain concepts from educational content and their relations, termed as educational knowledge graphs (EduKGs). Previous studies on EduKGs have i...
ver más
|
|
|
|
|
|
|
|
|
|
|
Isnaini Rosyida and Christiana Rini Indrati
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs), and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xiaochun Sun, Chenmou Wu and Shuqun Yang
With the proliferation of Knowledge Graphs (KGs), knowledge graph completion (KGC) has attracted much attention. Previous KGC methods focus on extracting shallow structural information from KGs or in combination with external knowledge, especially in com...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yelyzaveta Meleshko
Pág. 80 - 85
The subject matter of the article is the process of modeling social networks. The goal is to develop a computer model of a social network with a recommendation system. The tasks to be solved are to research the methods of generating social networks, to r...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yaniv Mordecai, James P. Fairbanks and Edward F. Crawley
This paper introduces a holistic framework, underpinned by Category Theory, for the process of conceptual modeling of complex engineered systems, generically representing the models as graph data structures, rendering stakeholder-informing views like mat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sukriti Bhattacharya, Christian Braun and Ulrich Leopold
Urbanization is leading us to a more chaotic state where healthy living becomes a prime concern. The high-rise buildings influence the urban setting with a high shadow rate on surroundings that can have no positive impact on the general neighborhood. Nev...
ver más
|
|
|
|
|
|
|
|
|
|
|
Swarnendu Ghosh, Teresa Gonçalves and Nibaran Das
Conceptual representations of images involving descriptions of entities and their relations are often represented using scene graphs. Such scene graphs can express relational concepts by using sets of triplets ⟨subject—predicate&...
ver más
|
|
|
|
|
|
|
|
|
|
|
Md Saiful Islam and Fei Liu
In the realm of artificial intelligence, knowledge graphs have become an effective area of research. Relationships between entities are depicted through a structural framework in knowledge graphs. In this paper, we propose to build a domain-specific medi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christos Makris, Georgios Pispirigos and Ioannis Orestis Rizos
Presently, due to the extended availability of gigantic information networks and the beneficial application of graph analysis in various scientific fields, the necessity for efficient and highly scalable community detection algorithms has never been more...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohd Samsudin Abdul Hamid, Nasir Shafiq and Osamah Kiwan
The concept of a sustainable environment generally refers to the development that creates a balance between the resources consumption pattern and the rate of depletion of natural resources. For determining the level of sustainability of any project, thre...
ver más
|
|
|
|
|
|
|
|
|
|
|
Borislav Slavchev, Evelina Masliankova and Steven Kelk
We present an algorithm selection framework based on machine learning for the exact computation of treewidth, an intensively studied graph parameter that is NP-hard to compute. Specifically, we analyse the comparative performance of three state-of-the-ar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fabio Viola, Luca Roffia, Francesco Antoniazzi, Alfredo D?Elia, Cristiano Aguzzi and Tullio Salmon Cinotti
This article presents Tarsier, a tool for the interactive 3D visualization of RDF graphs. Tarsier is mainly intended to support teachers introducing students to Semantic Web data representation formalisms and developers in the debugging of applications b...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fabio Viola, Luca Roffia, Francesco Antoniazzi, Alfredo D?Elia, Cristiano Aguzzi and Tullio Salmon Cinotti
This article presents Tarsier, a tool for the interactive 3D visualization of RDF graphs. Tarsier is mainly intended to support teachers introducing students to Semantic Web data representation formalisms and developers in the debugging of applications b...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sanaa Alwidian, Daniel Amyot and Yngve Lamo
A model family is a set of related models in a given language, with commonalities and variabilities that result from evolution of models over time and/or variation over intended usage (the spatial dimension). As the family size increases, it becomes cumb...
ver más
|
|
|
|
|
|
|
|
|
|
|
Garima Agrawal, Yuli Deng, Jongchan Park, Huan Liu and Ying-Chih Chen
Knowledge graphs gained popularity in recent years and have been useful for concept visualization and contextual information retrieval in various applications. However, constructing a knowledge graph by scraping long and complex unstructured texts for a ...
ver más
|
|
|
|
|
|
|
|
|
|
|
A.A. Ripinen,M.B. Abrosimov
Pág. 46 - 50
A graph G is called primitive if all vertices in it are mutually reachable in the same number of steps. The concept of primitivity was originally formulated for matrices and naturally extended to graphs when considering a graph as an adjacency matrix. Re...
ver más
|
|
|
|
|
|
|
|
|
|
|
A.A. Ripinen,M.B. Abrosimov
Pág. 46 - 50
A graph G is called primitive if all vertices in it are mutually reachable in the same number of steps. The concept of primitivity was originally formulated for matrices and naturally extended to graphs when considering a graph as an adjacency matrix. Re...
ver más
|
|
|
|
|
|