Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 29 for “"Attributed Graphs"”.
-
Modeling and Inferring Attributed Graphs
Graphs are a natural representation for systems with interacting components (e.g. an online social network of users; a transaction network of bank accounts; an interaction network of proteins). As such, algorithms that predict node labels have wide-ranged applications from online content …
-
ON THE PREDICTIVE MODELING OF ATTRIBUTED GRAPHS
… network, vast amounts of data can be viewed as attributed graphs as they are associated with attributes which describe the property of data and structure which reflects the inter-dependency among variables in the data. Given the broad coverage and the unique representation of attributed graphs, …
-
On Ranked Approximate Matching Of Large Attributed Graphs
… To access the information embedded in graphs, efficient graph matching tools and algorithms have become of prime importance. Although the prohibitively expensive time complexity associated with exact sub-graph isomorphism techniques has limited its efficacy in the application domain, …
-
Detecting Anomalies in Dynamic Attributed Graphs: An Unsupervised Learning Approach
Dynamic attributed graphs, which evolve over time and hold node-specific attributes, are essential in fields like social network analysis, where anomalous node detection is a growing area. Vehicular social networks (VSNs), a subset of these graphs, are ad hoc networks in which vehicles exchange …
-
Granular State Space Search
… search, we propose two new con- cepts, called an attributed graph and a granulated attributed graph, respectively. An attributed graph can be mapped into a state space and a granulated at- tributed graph can be mapped into an abstraction. We analyze characteristics of attributed graphs and …
-
Incidence networks for Geometric Deep Learning
… structured data. For example, we may represent attributed graphs using their node-node, node-edge, or edge-edge incidence matrices. In higher dimensions, incidence tensors can represent simplicial complexes and polytopes. In this work, we formalize incidence tensors, analyze their structure, and …
-
Finding topographically-similar regions in a triangulated terrain model
… selected region?" We use optimal-monomorphism in attributed graphs so that "topographically-similar" goes beyond simply matching terrain attributes to include the attributes and spatial relations of adjacent regions.
-
ENABLING LLM AGENTS TO CONTINUALLY PERCEIVE, LEARN, AND EVOLVE IN DIVERSE ENVIRONMENTS
… a self-supervised foundation model for text-attributed graphs that pairs a language model with a GNN encoder via masked neighborhood reconstruction and instruction tuning for zero-shot transfer, and extend it to multimodal graphs with UniGraph2 using frozen modality encoders, …
-
Network Representation Learning with Attributes and Heterogeneity
… perform various machine learning tasks. Graphs are often associated with diverse and rich information such as attributes that play an important role in the formation of the network. Thus, it is imperative to exploit this information to complement the structure information and learn a …
-
Harnessing graphs for knowledge representation in natural language processing
… language processing tasks through the use of graphs, aiming to enhance the performance of models across various domains, including finance and healthcare. Several novel approaches are proposed that fuse graph structures with modern deep learning techniques, addressing the challenges of missing …
-
Mining Interesting Subnetworks from Graphs with Node Attributes
… internet of things (IoT) is represented using graphs. With the global expansion of internet, social networks had an explosive growth with billions of users in FaceBook. Similarly research in Bio-informatics generated massive amounts of genomic data (protein protein interaction networks) from …
-
ECTree: An Extended Tree Index Structure for Attributed Subgraph Queries
Graphs are popular data structures for modeling complex data types, especially graphs with attributes for gene sequences, protein structures, chemical compounds, protein interaction networks, social networks, etc. There is a need for managing such graph data and providing efficient querying tools. …
-
Sensing and information extraction towards a population based structural health monitoring (PBSHM) framework for bridges
… Models can be used to describe bridges, and Attributed Graphs can be generated and compared for similarity. For a pool of six bridges, each described with IE models and compared as AG's, mode tests are carried out to check that similarity metrics between pairs of bridges are reflective of the …
-
Information Theoretic Graph Kernels
… novel information theoretic kernels for graphs. To this end, we commence in Chapter 3 by defining a family of Jensen-Shannon diffusion kernels, i.e., the information theoretic kernels, for (un)attributed graphs. We show that our kernels overcome the shortcomings of inefficiency (for the …
-
Data mining using concepts of independence, unimodality and homophily
… e.g. time series, texts, images, videos and graphs. Complex data is often high-dimensional and heterogeneous, which makes the separation of the wheat (knowledge) from the chaff (noise) more difficult. Clustering is a main mode of knowledge discovery from complex data, which groups objects in …
-
Machine Learning-Based Prediction of Sites of Metabolism in Drugs: Exploring Feature Extraction Methods on Molecular Graphs
… chemoinformatics tasks. Seeing molecules as attributed graphs, where atoms correspond to nodes and bonds correspond to edges, the SOM prediction problem can be formulated as a node classification task. We compare two methods of extracting node features from molecular graphs: a standard …
-
Cohesive Subgraph Computation in Graphs
… the skyline k-cliques model over multi-valued attributed graphs and develop efficient algorithms to conduct the computation. To verify the group based dominance between two k-cliques, we make use of maximum bipartite matching and develop a set of optimization techniques to improve the …
-
Efficient processing of advanced structural queries in graph databases
… trend is to study similarity queries. Moreover, graphs may possess multiple attributes on vertices, imposing additional challenges. Hence, indexing and processing methods for answering advanced structural queries are strongly in demand. The thesis studies three types of emerging structural …
Page 1 of 2