Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGrammar-Based Geodesics in Semantic Networks
158
0
0.0
(
0
)
Added by
Marko A. Rodriguez
Publication date
2010
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
A geodesic is the shortest path between two vertices in a connected network. The geodesic is the kernel of various network metrics including radius, diameter, eccentricity, closeness, and betweenness. These metrics are the foundation of much network research and thus, have been studied extensively in the domain of single-relational networks (both in their directed and undirected forms). However, geodesics for single-relational networks do not translate directly to multi-relational, or semantic networks, where vertices are connected to one another by any number of edge labels. Here, a more sophisticated method for calculating a geodesic is necessary. This article presents a technique for calculating geodesics in semantic networks with a focus on semantic networks represented according to the Resource Description Framework (RDF). In this framework, a discrete walker utilizes an abstract path description called a grammar to determine which paths to include in its geodesic calculation. The grammar-based model forms a general framework for studying geodesic metrics in semantic networks.
rate research
Read More
Semantic networks qualify the meaning of an edge relating any two vertices. Determining which vertices are most central in a semantic network is difficult because one relationship type may be deemed subjectively more important than another. For this reason, research into semantic network metrics has focused primarily on context-based rankings (i.e. user prescribed contexts). Moreover, many of the current semantic network metrics rank semantic associations (i.e. directed paths between two vertices) and not the vertices themselves. This article presents a framework for calculating semantically meaningful primary eigenvector-based metrics such as eigenvector centrality and PageRank in semantic networks using a modified version of the random walker model of Markov chain analysis. Random walkers, in the context of this article, are constrained by a grammar, where the grammar is a user defined data structure that determines the meaning of the final vertex ranking. The ideas in this article are presented within the context of the Resource Description Framework (RDF) of the Semantic Web initiative.
Like [1], we present an algorithm to compute the simulation of a query pattern in a graph of labeled nodes and unlabeled edges. However, our algorithm works on a compressed graph grammar, instead of on the original graph. The speed-up of our algorithm compared to the algorithm in [1] grows with the size of the graph and with the compression strength.
We present GraPPa, an effective pre-training approach for table semantic parsing that learns a compositional inductive bias in the joint representations of textual and tabular data. We construct synthetic question-SQL pairs over high-quality tables via a synchronous context-free grammar (SCFG) induced from existing text-to-SQL datasets. We pre-train our model on the synthetic data using a novel text-schema linking objective that predicts the syntactic role of a table field in the SQL for each question-SQL pair. To maintain the models ability to represent real-world data, we also include masked language modeling (MLM) over several existing table-and-language datasets to regularize the pre-training process. On four popular fully supervised and weakly supervised table semantic parsing benchmarks, GraPPa significantly outperforms RoBERTa-large as the feature representation layers and establishes new state-of-the-art results on all of them.
In the last decade, many semantic-based routing protocols had been designed for peer-to-peer systems. However, they are not suitable for IoT systems, mainly due to their high demands in memory and computing power which are not available in many IoT devices. In this paper, we develop a semantic-based routing protocol for dynamic IoT systems to facilitate dynamic IoT capability discovery and composition. Our protocol is a fully decentralized routing protocol. To reduce the space requirement for routing, each node maintains a summarized routing table. We design an ontology-based summarization algorithm to smartly group similar capabilities in the routing tables and support adaptive routing table compression. We also design an ontology coding scheme to code keywords used in the routing tables and query messages. To complete the summarization scheme, we consider the metrics for choosing the summarization candidates in an overflowing routing table. Some of these metrics are novel and are difficult to measure, such as coverage and stability. Our solutions significantly reduce the routing table size, ensuring that the routing table size can be bounded by the available memory of the IoT devices, while supporting efficient IoT capability lookup. Experimental results show that our approach can yield significantly lower network traffic and memory requirement for IoT capability lookup when compared with existing semantic-based routing algorithms including a centralized solution, a DHT-based approach, a controlled flooding scheme, and a cache-based solution.
Social media hold valuable, vast and unstructured information on public opinion that can be utilized to improve products and services. The automatic analysis of such data, however, requires a deep understanding of natural language. Current sentiment analysis approaches are mainly based on word co-occurrence frequencies, which are inadequate in most practical cases. In this work, we propose a novel hybrid framework for concept-level sentiment analysis in Persian language, that integrates linguistic rules and deep learning to optimize polarity detection. When a pattern is triggered, the framework allows sentiments to flow from words to concepts based on symbolic dependency relations. When no pattern is triggered, the framework switches to its subsymbolic counterpart and leverages deep neural networks (DNN) to perform the classification. The proposed framework outperforms state-of-the-art approaches (including support vector machine, and logistic regression) and DNN classifiers (long short-term memory, and Convolutional Neural Networks) with a margin of 10-15% and 3-4% respectively, using benchmark Persian product and hotel reviews corpora.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
