Relevant bibliographies by topics / Relation Graphs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Relation Graphs'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Relation Graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Relation Graphs"

1

Gholap, P. S., and V. E. Nikumbh. "TOPOLOGICAL SPACES GENERATED BY GRAPH." Jnanabha 52, no. 01 (2022): 01–07. http://dx.doi.org/10.58250/jnanabha.2022.52101.

Full text
Abstract:
n this paper we discuss topological spaces generated by simple graphs using adjacency relation and non adjacency relation on vertices. We establish important results showing relations between complete graph and discrete topological space. We also discuss the topological spaces related to complete graphs, isomorphic graphs and study their properties. Further we discuss the interior and closure operators and their properties. Our motivation is to give an fundamental step toward linkage between topology and graph so as to study different aspects of graphs in terms of topological properties
APA, Harvard, Vancouver, ISO, and other styles
2

Ke, Xiangyu, Arijit Khan, and Francesco Bonchi. "Multi-relation Graph Summarization." ACM Transactions on Knowledge Discovery from Data 16, no. 5 (2022): 1–30. http://dx.doi.org/10.1145/3494561.

Full text
Abstract:
Graph summarization is beneficial in a wide range of applications, such as visualization, interactive and exploratory analysis, approximate query processing, reducing the on-disk storage footprint, and graph processing in modern hardware. However, the bulk of the literature on graph summarization surprisingly overlooks the possibility of having edges of different types. In this article, we study the novel problem of producing summaries of multi-relation networks, i.e., graphs where multiple edges of different types may exist between any pair of nodes. Multi-relation graphs are an expressive mo
APA, Harvard, Vancouver, ISO, and other styles
3

Ratheesh, K. P. "On Soft Graphs and Chained Soft Graphs." International Journal of Fuzzy System Applications 7, no. 2 (2018): 85–102. http://dx.doi.org/10.4018/ijfsa.2018040105.

Full text
Abstract:
Soft set theory has a rich potential for application in many scientific areas such as medical science, engineering and computer science. This theory can deal uncertainties in nature by parametrization process. In this article, the authors explore the concepts of soft relation on a soft set, soft equivalence relation on a soft set, soft graphs using soft relation, vertex chained soft graphs and edge chained soft graphs and investigate various types of operations on soft graphs such as union, join and complement. Also, it is established that every fuzzy graph is an edge chained soft graph.
APA, Harvard, Vancouver, ISO, and other styles
4

Guo, Yunfei, Fei Yin, Wei Feng, et al. "Social Relation Reasoning Based on Triangular Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 1 (2023): 737–45. http://dx.doi.org/10.1609/aaai.v37i1.25151.

Full text
Abstract:
Social networks are essentially in a graph structure where persons act as nodes and the edges connecting nodes denote social relations. The prediction of social relations, therefore, relies on the context in graphs to model the higher-order constraints among relations, which has not been exploited sufficiently by previous works, however. In this paper, we formulate the paradigm of the higher-order constraints in social relations into triangular relational closed-loop structures, i.e., triangular constraints, and further introduce the triangular reasoning graph attention network (TRGAT). Our TR
APA, Harvard, Vancouver, ISO, and other styles
5

Koch, Sebastian. "Unification of Graphs and Relations in Mizar." Formalized Mathematics 28, no. 2 (2020): 173–86. http://dx.doi.org/10.2478/forma-2020-0015.

Full text
Abstract:
Summary A (di)graph without parallel edges can simply be represented by a binary relation of the vertices and on the other hand, any binary relation can be expressed as such a graph. In this article, this correspondence is formalized in the Mizar system [2], based on the formalization of graphs in [6] and relations in [11], [12]. Notably, a new definition of createGraph will be given, taking only a non empty set V and a binary relation E ⊆ V × V to create a (di)graph without parallel edges, which will provide to be very useful in future articles.
APA, Harvard, Vancouver, ISO, and other styles
6

Yang, Wenjie, Jianlin Zhang, Jingju Cai, and Zhiyong Xu. "Relation Selective Graph Convolutional Network for Skeleton-Based Action Recognition." Symmetry 13, no. 12 (2021): 2275. http://dx.doi.org/10.3390/sym13122275.

Full text
Abstract:
Graph convolutional networks (GCNs) have made significant progress in the skeletal action recognition task. However, the graphs constructed by these methods are too densely connected, and the same graphs are used repeatedly among channels. Redundant connections will blur the useful interdependencies of joints, and the overly repetitive graphs among channels cannot handle changes in joint relations between different actions. In this work, we propose a novel relation selective graph convolutional network (RS-GCN). We also design a trainable relation selection mechanism. It encourages the model t
APA, Harvard, Vancouver, ISO, and other styles
7

Flippen, Christopher, Allison H. Moore, and Essak Seddiq. "Quotients of the Gordian and H(2)-Gordian graphs." Journal of Knot Theory and Its Ramifications 30, no. 05 (2021): 2150037. http://dx.doi.org/10.1142/s0218216521500371.

Full text
Abstract:
The Gordian graph and H(2)-Gordian graphs of knots are abstract graphs whose vertex sets represent isotopy classes of unoriented knots, and whose edge sets record whether pairs of knots are related by crossing changes or H(2)-moves, respectively. We investigate quotients of these graphs under equivalence relations defined by several knot invariants including the determinant, the span of the Jones polynomial, and an invariant related to tricolorability. We show, in all cases considered, that the quotient graphs are Gromov hyperbolic. We then prove a collection of results about the graph isomorp
APA, Harvard, Vancouver, ISO, and other styles
8

Sun, Ke, Shuo Yu, Ciyuan Peng, et al. "Relational Structure-Aware Knowledge Graph Representation in Complex Space." Mathematics 10, no. 11 (2022): 1930. http://dx.doi.org/10.3390/math10111930.

Full text
Abstract:
Relations in knowledge graphs have rich relational structures and various binary relational patterns. Various relation modelling strategies are proposed for embedding knowledge graphs, but they fail to fully capture both features of relations, rich relational structures and various binary relational patterns. To address the problem of insufficient embedding due to the complexity of the relations, we propose a novel knowledge graph representation model in complex space, namely MARS, to exploit complex relations to embed knowledge graphs. MARS takes the mechanisms of complex numbers and message-
APA, Harvard, Vancouver, ISO, and other styles
9

Yurttas Gunes, Aysun, Sadik Delen, Musa Demirci, Ahmet Sinan Cevik, and Ismail Naci Cangul. "Fibonacci Graphs." Symmetry 12, no. 9 (2020): 1383. http://dx.doi.org/10.3390/sym12091383.

Full text
Abstract:
Apart from its applications in Chemistry, Biology, Physics, Social Sciences, Anthropology, etc., there are close relations between graph theory and other areas of Mathematics. Fibonacci numbers are of utmost interest due to their relation with the golden ratio and also due to many applications in different areas from Biology, Architecture, Anatomy to Finance. In this paper, we define Fibonacci graphs as graphs having degree sequence consisting of n consecutive Fibonacci numbers and use the invariant Ω to obtain some more information on these graphs. We give the necessary and sufficient conditi
APA, Harvard, Vancouver, ISO, and other styles
10

An, Dezhi, Xuejie Ma, Cao Jiang, Lei Liu, and Yanxu Wang. "Research and Application of Relation Extraction based on Triple Relation Graph Convolutional Networks." Journal of Physics: Conference Series 2166, no. 1 (2022): 012060. http://dx.doi.org/10.1088/1742-6596/2166/1/012060.

Full text
Abstract:
Abstract In recent years, data in non-Euclidean spaces is becoming more and more. Traditional methods cannot perform feature extraction on these data. Most of existing methods just extract contextual semantic features from relational instances. Their structural features in corpora are ignored. To solve this problem, the paper proposed a relation extraction method based on triple relation graph convolutional networks (TRGCN). Based on the extraction of semantic features of sentences using convolutional neural networks, this method used the concept of triple relation graphs to represent structur
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Relation Graphs"

1

Mercier, Pierre-Adelin. "Graphages à type d'isomorphisme prescrit." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2012. http://tel.archives-ouvertes.fr/tel-00751265.

Full text
Abstract:
On considère R une relation d'équivalence borélienne standard de type I I1 sur un espace de probabilités (X, µ). On étudie une certaine propriété d'homogénéité pour un graphage fixé de la relation R : on suppose que les feuilles du graphage sont toutes isomorphes à un certain graphe transitif (connexe, infini, localement fini) Γ. Que peut-on dire sur la relation ? Dans ce cas, en considérant une action "à la Mackey", on montre qu'il existe (Z ,η) un revêtement standard probabilisé de (X, µ), une action libre (qui préserve η) sur Z du groupe G (localement compact, à base dénombrable d'ouverts) des
APA, Harvard, Vancouver, ISO, and other styles
2

Byrne, Kate. "Populating the Semantic Web : combining text and relational databases as RDF graphs." Thesis, University of Edinburgh, 2009. http://hdl.handle.net/1842/3781.

Full text
Abstract:
The Semantic Web promises a way of linking distributed information at a granular level by interconnecting compact data items instead of complete HTML pages. New data is gradually being added to the Semantic Web but there is a need to incorporate existing knowledge. This thesis explores ways to convert a coherent body of information from various structured and unstructured formats into the necessary graph form. The transformation work crosses several currently active disciplines, and there are further research questions that can be addressed once the graph has been built. Hybrid databases, such
APA, Harvard, Vancouver, ISO, and other styles
3

Bouakaz, Adnan. "Real-time scheduling of dataflow graphs." Phd thesis, Université Rennes 1, 2013. http://tel.archives-ouvertes.fr/tel-00945453.

Full text
Abstract:
The ever-increasing functional and nonfunctional requirements in real-time safety-critical embedded systems call for new design flows that solve the specification, validation, and synthesis problems. Ensuring key properties, such as functional determinism and temporal predictability, has been the main objective of many embedded system design models. Dataflow models of computation (such as KPN, SDF, CSDF, etc.) are widely used to model stream-based embedded systems due to their inherent functional determinism. Since the introduction of the (C)SDF model, a considerable effort has been made to so
APA, Harvard, Vancouver, ISO, and other styles
4

Eichler, Kathrin [Verfasser], and Josef van [Akademischer Betreuer] Genabith. "Generating and applying textual entailment graphs for relation extraction and email categorization / Kathrin Eichler ; Betreuer: Josef van Genabith." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2018. http://d-nb.info/1162892242/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Capshaw, Riley. "Relation Classification using Semantically-Enhanced Syntactic Dependency Paths : Combining Semantic and Syntactic Dependencies for Relation Classification using Long Short-Term Memory Networks." Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153877.

Full text
Abstract:
Many approaches to solving tasks in the field of Natural Language Processing (NLP) use syntactic dependency trees (SDTs) as a feature to represent the latent nonlinear structure within sentences. Recently, work in parsing sentences to graph-based structures which encode semantic relationships between words—called semantic dependency graphs (SDGs)—has gained interest. This thesis seeks to explore the use of SDGs in place of and alongside SDTs within a relation classification system based on long short-term memory (LSTM) neural networks. Two methods for handling the information in these graphs a
APA, Harvard, Vancouver, ISO, and other styles
6

Benkoussas, Chahinez. "Approches non supervisées pour la recommandation de lectures et la mise en relation automatique de contenus au sein d'une bibliothèque numérique." Thesis, Aix-Marseille, 2016. http://www.theses.fr/2016AIXM4379/document.

Full text
Abstract:
Cette thèse s’inscrit dans le domaine de la recherche d’information (RI) et la recommandation de lecture. Elle a pour objets :— La création de nouvelles approches de recherche de documents utilisant des techniques de combinaison de résultats, d’agrégation de données sociales et de reformulation de requêtes ;— La création d’une approche de recommandation utilisant des méthodes de RI et les graphes entre les documents. Deux collections de documents ont été utilisées. Une collection qui provient de l’évaluation CLEF (tâche Social Book Search - SBS) et la deuxième issue du domaine des sciences hum
APA, Harvard, Vancouver, ISO, and other styles
7

Ravelo, Jesus N. "Relations, graphs and programs." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Atto, Muhsin. "Implementing Order Relations on Graphs." Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-101170.

Full text
Abstract:
<p>The design of automatic verification methods for programs manipulating dynamic data structures is a challenging problem. We consider programs that operate on a data structures with one next-pointer, such as singly linked lists and circular lists. We refer to such data structures as heaps. We represent a heap as a graph, where vertices in the graph represent cells in the heap. To test that a program is safe, we should check that the out put of this program is well formed and is sorted. The aim of this project is to design a number of algorithms to test the different orderings between graphs
APA, Harvard, Vancouver, ISO, and other styles
9

Lucas, Claire. "Trois essais sur les relations entre les invariants structuraux des graphes et le spectre du Laplacien sans signe." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00956183.

Full text
Abstract:
Le spectre du Laplacien sans signe a fait l'objet de beaucoup d'attention dans la communauté scientifique ces dernières années. La principale raison est l'intuition, basée sur une étude des petits graphes et sur des propriétés valides pour des graphes de toutes tailles, que plus de graphes sont déterminés par le spectre de cette matrice que par celui de la matrice d'adjacence et du Laplacien. Les travaux présentés dans cette thèse ont apporté des éléments nouveaux sur les informations contenues dans le spectre cette matrice. D'une part, on y présente des relations entre les invariants de struc
APA, Harvard, Vancouver, ISO, and other styles
10

Haugeard, Jean-Emmanuel. "Extraction et reconnaissance de primitives dans les façades de Paris à l'aide d'appariement de graphes." Thesis, Cergy-Pontoise, 2010. http://www.theses.fr/2010CERG0497.

Full text
Abstract:
Cette dernière décennie, la modélisation des villes 3D est devenue l'un des enjeux de la recherche multimédia et un axe important en reconnaissance d'objets. Dans cette thèse nous nous sommes intéressés à localiser différentes primitives, plus particulièrement les fenêtres, dans les façades de Paris. Dans un premier temps, nous présentons une analyse des façades et des différentes propriétés des fenêtres. Nous en déduisons et proposons ensuite un algorithme capable d'extraire automatiquement des hypothèses de fenêtres. Dans une deuxième partie, nous abordons l'extraction et la reconnaissance d
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Relation Graphs"

1

Schmidt, Gunther, and Thomas Ströhlein. Relations and Graphs. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-77968-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bader, David A., 1969- editor of compilation, Meyerhenke, Henning, 1978- editor of compilation, Sanders, Peter, editor of compilation, and Wagner, Dorothea, 1957- editor of compilation, eds. Graph partitioning and graph clustering: 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA. American Mathematical Society, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Schmidt, Gunther. Relations and graphs: Discrete mathematics for computer scientists. New York, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schmidt, Gunther. Relations and graphs: Discrete mathematics for computer scientists. Springer, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Varlamov, Oleg. Mivar databases and rules. INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1508665.

Full text
Abstract:
The multidimensional open epistemological active network MOGAN is the basis for the transition to a qualitatively new level of creating logical artificial intelligence. Mivar databases and rules became the foundation for the creation of MOGAN. The results of the analysis and generalization of data representation structures of various data models are presented: from relational to "Entity — Relationship" (ER-model). On the basis of this generalization, a new model of data and rules is created: the mivar information space "Thing-Property-Relation". The logic-computational processing of data in th
APA, Harvard, Vancouver, ISO, and other styles
6

University of Exeter. Centre for Innovation in Mathematics Teaching, ed. Relations by experiment. Centre for Innovation in Mathematics Teaching, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Productions, JN, ed. Oresama teacher: Eternal relation. Viz Media, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Janowitz, M. F. Ordinal and relational clustering. World Scientific, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rebecca, Otis, ed. Friends and relations: Using literature with social themes, grades 3-5. Northeast Foundation for Children, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fraïssé, Roland. La reconstruction d'une relation dans l'hypothèse forte: Isomorphie des restrictions à chaque partie stricte de la base. Presses de l'Université Laval, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Relation Graphs"

1

Schmidt, Gunther, and Thomas Ströhlein. "Graphs: Associated Relation, Incidence, Adjacency." In Relations and Graphs. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-77968-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Blanchard, Philippe, and Dimitri Volchenkov. "Worth Another Binary Relation: Graphs." In Springer Series in Synergetics. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19592-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dwivedi, Sri Nath, Harish Karnick, and Renu Jain. "Relation Classification: How Well Do Neural Network Approaches Work?" In Knowledge Graphs and Semantic Web. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65384-2_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Carvalho, Danilo S., André Freitas, and João C. P. da Silva. "Graphia: Extracting Contextual Relation Graphs from Text." In Advanced Information Systems Engineering. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41242-4_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mohamed, Sameh K., Emir Muñoz, Vít Nováček, and Pierre-Yves Vandenbussche. "Identifying Equivalent Relation Paths in Knowledge Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59888-8_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rios-Alvarado, Ana B., Jose L. Martinez-Rodriguez, Tania Y. Guerrero-Melendez, Adolfo J. Rodriguez-Rodriguez, and David T. Vargas-Requena. "Axiomatic Relation Extraction from Text in the Domain of Tourism." In Knowledge Graphs and Semantic Web. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65384-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pollandt, Silke. "Relation Graphs: A Structure for Representing Relations in Contextual Logic of Relations." In Conceptual Structures: Integration and Interfaces. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45483-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Nojima, Yusuke, Yasuhito Asano, and Masatoshi Yoshikawa. "Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks." In Computational Geometry and Graphs. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45281-9_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Deng, Jia, Nan Ding, Yangqing Jia, et al. "Large-Scale Object Classification Using Label Relation Graphs." In Computer Vision – ECCV 2014. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10590-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sun, Zequn, Jiacheng Huang, Wei Hu, Muhao Chen, Lingbing Guo, and Yuzhong Qu. "TransEdge: Translating Relation-Contextualized Embeddings for Knowledge Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30793-6_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Relation Graphs"

1

Huang, Zhichao, Xutao Li, Yunming Ye, and Michael K. Ng. "MR-GCN: Multi-Relational Graph Convolutional Networks based on Generalized Tensor Product." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/175.

Full text
Abstract:
Graph Convolutional Networks (GCNs) have been extensively studied in recent years. Most of existing GCN approaches are designed for the homogenous graphs with a single type of relation. However, heterogeneous graphs of multiple types of relations are also ubiquitous and there is a lack of methodologies to tackle such graphs. Some previous studies address the issue by performing conventional GCN on each single relation and then blending their results. However, as the convolutional kernels neglect the correlations across relations, the strategy is sub-optimal. In this paper, we propose the Multi
APA, Harvard, Vancouver, ISO, and other styles
2

Sousa, Rita T., Sara Silva, and Catia Pesquita. "Explainable Representations for Relation Prediction in Knowledge Graphs." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/62.

Full text
Abstract:
Knowledge graphs represent real-world entities and their relations in a semantically-rich structure supported by ontologies. Exploring this data with machine learning methods often relies on knowledge graph embeddings, which produce latent representations of entities that preserve structural and local graph neighbourhood properties, but sacrifice explainability. However, in tasks such as link or relation prediction, understanding which specific features better explain a relation is crucial to support complex or critical applications. We propose SEEK, a novel approach for explainable representa
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Fuxiang, Xin Wang, Zhao Li, and Jianxin Li. "TransRHS: A Representation Learning Method for Knowledge Graphs with Relation Hierarchical Structure." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/413.

Full text
Abstract:
Representation learning of knowledge graphs aims to project both entities and relations as vectors in a continuous low-dimensional space. Relation Hierarchical Structure (RHS), which is constructed by a generalization relationship named subRelationOf between relations, can improve the overall performance of knowledge representation learning. However, most of the existing methods ignore this critical information, and a straightforward way of considering RHS may have a negative effect on the embeddings and thus reduce the model performance. In this paper, we propose a novel method named TransRHS
APA, Harvard, Vancouver, ISO, and other styles
4

Ye, Rui, Xin Li, Yujie Fang, Hongyu Zang, and Mingzhong Wang. "A Vectorized Relational Graph Convolutional Network for Multi-Relational Network Alignment." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/574.

Full text
Abstract:
Alignment of multiple multi-relational networks, such as knowledge graphs, is vital for AI applications. Different from the conventional alignment models, we apply the graph convolutional network (GCN) to achieve more robust network embedding for the alignment task. In comparison with existing GCNs which cannot fully utilize multi-relation information, we propose a vectorized relational graph convolutional network (VR-GCN) to learn the embeddings of both graph entities and relations simultaneously for multi-relational networks. The role discrimination and translation property of knowledge grap
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Huijuan, Siming Dai, Weiyue Su, et al. "Simple and Effective Relation-based Embedding Propagation for Knowledge Representation Learning." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/382.

Full text
Abstract:
Relational graph neural networks have garnered particular attention to encode graph context in knowledge graphs (KGs). Although they achieved competitive performance on small KGs, how to efficiently and effectively utilize graph context for large KGs remains an open problem. To this end, we propose the Relation-based Embedding Propagation (REP) method. It is a post-processing technique to adapt pre-trained KG embeddings with graph context. As relations in KGs are directional, we model the incoming head context and the outgoing tail context separately. Accordingly, we design relational context
APA, Harvard, Vancouver, ISO, and other styles
6

Wu, Yuting, Xiao Liu, Yansong Feng, Zheng Wang, Rui Yan, and Dongyan Zhao. "Relation-Aware Entity Alignment for Heterogeneous Knowledge Graphs." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/733.

Full text
Abstract:
Entity alignment is the task of linking entities with the same real-world identity from different knowledge graphs (KGs), which has been recently dominated by embedding-based methods. Such approaches work by learning KG representations so that entity alignment can be performed by measuring the similarities between entity embeddings. While promising, prior works in the field often fail to properly capture complex relation information that commonly exists in multi-relational KGs, leaving much room for improvement. In this paper, we propose a novel Relation-aware Dual-Graph Convolutional Network
APA, Harvard, Vancouver, ISO, and other styles
7

Pan, Jia-Hui, Jibin Gao, and Wei-Shi Zheng. "Action Assessment by Joint Relation Graphs." In 2019 IEEE/CVF International Conference on Computer Vision (ICCV). IEEE, 2019. http://dx.doi.org/10.1109/iccv.2019.00643.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Banerjee, Arindam, Sugato Basu, and Srujana Merugu. "Multi-way Clustering on Relation Graphs." In Proceedings of the 2007 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, 2007. http://dx.doi.org/10.1137/1.9781611972771.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yang, Qiang, Qiannan Zhang, Chuxu Zhang, and Xiangliang Zhang. "Interpretable Relation Learning on Heterogeneous Graphs." In WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining. ACM, 2022. http://dx.doi.org/10.1145/3488560.3498508.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mandya, Angrosh, Danushka Bollegala, and Frans Coenen. "Graph Convolution over Multiple Dependency Sub-graphs for Relation Extraction." In Proceedings of the 28th International Conference on Computational Linguistics. International Committee on Computational Linguistics, 2020. http://dx.doi.org/10.18653/v1/2020.coling-main.565.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Relation Graphs"

1

Baader, Franz, Ralf Molitor, and Stefan Tobies. On the Relation between Conceptual Graphs and Description Logics. Aachen University of Technology, 1998. http://dx.doi.org/10.25368/2022.87.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Barooah, Prabir, and Joao P. Hespanha. Estimation from Relative Measurements: Electrical Analogy and Large Graphs. Defense Technical Information Center, 2007. http://dx.doi.org/10.21236/ada473862.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kaplan, I., G. Abdulla, S. Brugger, and S. Kohn. Implementing Graph Pattern Queries on a Relational Database. Office of Scientific and Technical Information (OSTI), 2007. http://dx.doi.org/10.2172/924192.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hidders, Jan, Bei Li, and George Fletcher, eds. Property Graph Schema contributions to WG3. Linked Data Benchmark Council, 2020. http://dx.doi.org/10.54285/ldbc.ofjf3566.

Full text
Abstract:
Five papers and three accompanying presentations contributed to the ISO/IEC JTC 1/SC 32 WG3 (Database Languages) standards committee relating to property graph schema, including meta-properties and keys
APA, Harvard, Vancouver, ISO, and other styles
5

Fait, Aaron, Grant Cramer, and Avichai Perl. Towards improved grape nutrition and defense: The regulation of stilbene metabolism under drought. United States Department of Agriculture, 2014. http://dx.doi.org/10.32747/2014.7594398.bard.

Full text
Abstract:
The goals of the present research proposal were to elucidate the physiological and molecular basis of the regulation of stilbene metabolism in grape, against the background of (i) grape metabolic network behavior in response to drought and of (ii) varietal diversity. The specific objectives included the study of the physiology of the response of different grape cultivars to continuous WD; the characterization of the differences and commonalities of gene network topology associated with WD in berry skin across varieties; the study of the metabolic response of developing berries to continuous WD
APA, Harvard, Vancouver, ISO, and other styles
6

Conrad, Shane B. Loyalty, Leadership, and the Profession: A Grass Roots Approach to Civil-Military Relations. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada553154.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Barrera-Osorio, Felipe, Paul Gertler, Nozomi Nakajima, and Harry A. Patrinos. Promoting Parental Involvement in Schools: Evidence from Two Randomized Experiments. Research on Improving Systems of Education (RISE), 2021. http://dx.doi.org/10.35489/bsg-rise-wp_2021/060.

Full text
Abstract:
Parental involvement programs aim to strengthen school-home relations with the goal of improving children’s educational outcomes. We examine the effects of a parental involvement program in Mexico, which provides parent associations with grants and information. We separately estimate the effect of the grants from the effect of the information using data from two randomized controlled trials conducted by the government during the rollout of the program. Grants to parent associations did not improve educational outcomes. Information to parent associations reduced disciplinary actions in schools,
APA, Harvard, Vancouver, ISO, and other styles
8

Rodríguez, María Ximena, Andrés Díaz, Jimmy Zapata, Alex Smith, and Paula Mesa. Avances en el manejo y control de Fusarium oxysporum en el cultivo de uchuva (physalis peruviana). Corporación colombiana de investigación agropecuaria - AGROSAVIA, 2021. http://dx.doi.org/10.21930/agrosavia.cartilla.2012.1.

Full text
Abstract:
La uchuva (Physalis peruviana) es una planta perenne, herbácea, que crece silvestre o semisilvestre. Se propaga normalmente por semilla; sus flores son solitarias y hermafroditas, fácilmente polinizadas por insectos, el viento o autopolinización. El fruto es una baya globosa u ovoide y jugosa, con un diámetro entre 1.25 y 2.15 cm y un peso entre 4 a 10 gramos, con una estructura interna similar a la de un tomate. La baya varía de color amarillo a ocre o amarillo naranja cuando madura; su piel es delgada y lustrosa y está recubierta con un cáliz o capacho (Figura 1). El cultivo de la uchuva pre
APA, Harvard, Vancouver, ISO, and other styles
9

Berlinski, Samuel, Matías Busso, Taryn Dinkelman, and Claudia Martínez. Research Insights: Can Low-Cost Communication Technologies Bridge Information Gaps between Schools and Parents? Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003737.

Full text
Abstract:
We document large gaps between parents knowledge and school reports of students attendance and grades. Sending frequent text messages with information on attendance, grades and school behavior shrinks those gaps. Parents of at-risk students adjust their understanding of their children's performance to the greatest degree. High-frequency text messages had positive impacts on grades and attendance. Math GPA increased 0.08 of a standard deviation; the probability of earning a passing grade in math increased by 2.7 percentage points (relative to a mean of 90 percent). The intervention also reduced
APA, Harvard, Vancouver, ISO, and other styles
10

Schwarte, Kirk A., and James R. Russell. Grazing Management Effects on the Sward and Physical Characteristics Relative to Streams in Cool-Season Grass Pastures. Iowa State University, 2009. http://dx.doi.org/10.31274/ans_air-180814-71.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography