With the development and improvement of modern surveying remote-sensing technology, data in fields remote sensing have grown rapidly. Due to characteristics large-scale, heterogeneous diverse surveys loose organization data, effectively obtaining information knowledge from can be difficult. Therefore, this paper proposes a method using ontology for integration. Based on heterogeneous, decentral...

This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H , ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H . If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its root graph construction. During the root graph cons...

Graph construction is the essential first step for nearly all manifold learning algorithms. While many applications assume that a simple k-nearest or -close neighbors graph will accurately model the topology of the underlying manifold, these methods often require expert tuning and may not produce high quality graphs. In this paper, the hyperparameter sensitivity of existing graph construction m...

We introduce s-graph grammars, a new grammar formalism for computing graph-based semantic representations. Semantically annotated corpora which use graphs as semantic representations have recently become available, and there have been a number of data-driven systems for semantic parsing that can be trained on these corpora. However, it is hard to map the linguistic assumptions of these systems ...

Just accessing graphs is a difficult task for blind and partially-sighted people let alone constructing graphs by themselves. By using multimodal Virtual Reality technologies, graphs rendered in a computer can be explored by blind people relatively easily. This has been validated in our research on multimodal data visualisation systems. In this paper we introduce a new development of a Web-base...

A k-matching M of a graph G = (V,E) is subset ⊆ E such that each connected component in the subgraph F (V,M) either single-vertex or k-regular, i.e., vertex has degree k. In this contribution, we are interested k-matchings four standard products: Cartesian, strong, direct and lexicographic product. As shall see, problem finding non-empty (k ≥ 3) products NP-complete. Due to general intractabili...