ComputingComputer ScienceInformation SystemsBusiness IntelligenceData MiningKnowledge RepresentationEntity-relationship ModelingGraph AnalyticsKnowledge GraphsQuery ProcessingSemantic NetworksStructured Query LanguageBusiness Intelligence SystemsGraph Data StructuresGraph QueryingGraph Similarity SearchGraph-based Knowledge RepresentationGraph-based Relationship AnalysisRdf Modeling
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as similarity of entities based on a specific notion of similarity called r-isomorphism. It formalizes these notions for the RDF data model, by introducing a notion of a Property Sequence as a type. In the context of a graph model such as that for RDF, Semantic Associations amount to specific certain graph signatures. Specifically, they refer to sequences (i.e. directed paths) here called Property Sequences, between entities, networks of Property Sequences (i.e. undirected paths), or subgraphs of r-isomorphic Property Sequences.The ability to query about the existence of such relationships is fundamental to tasks in analytical domains such as national security and business intelligence, where tasks often focus on finding complex yet meaningful and obscured relationships between entities. However, support for such queries is lacking in contemporary query systems, including those for RDF.
29
Mining association rules between sets of items in large databases
Rakesh Agrawal, Tomasz Imieliński, Arun Swami · 1993 · 14.8K citations · Full text
The Lorel query language for semistructured data
Serge Abiteboul, Dallan Quass, Jason McHugh et al. · International Journal on Digital Libraries · 1997 · 1.1K citations
Gregory Karvounarakis, Sofia Alexaki, Vassilis Christophides et al. · 2002 · 438 citations