• KIISE Transactions on Computing Practices
• /
• v.21 no.7
• /
• pp.452-457
• /
• 2015

In this paper, we propose a spatial query processor, SQUERY, which can derive rich query results through spatial reasoning on the initial knowledge base, as well as, process both qualitative and quantitative queries about the topological and directional relationships between spatial objects. In order to derive richer query results, the query processor expands the knowledge base by applying forward spatial reasoning into the initial knowledge base in a preprocessing step. The proposed query processor uses not only qualitative spatial knowledge describing topological/directional relationship between spatial objects, but also utilizes quantitative spatial knowledge including geometric data of individual spatial objects through geometric computation. The results of an experiment with the OSM(Open Street Map) spatial knowledge base demonstrates the high performance of our spatial query processing system.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.11
• /
• pp.569-584
• /
• 2016

In this paper, we present a spatial knowledge extractor implemented in Hadoop MapReduce parallel, distributed computing environment. From a large spatial dataset, this knowledge extractor automatically derives a qualitative spatial knowledge base, which consists of both topological and directional relations on pairs of two spatial objects. By using R-tree index and range queries over a distributed spatial data file on HDFS, the MapReduce-enabled spatial knowledge extractor, MRSPAKE, can produce a web-scale spatial knowledge base in highly efficient way. In experiments with the well-known open spatial dataset, Open Street Map (OSM), the proposed web-scale spatial knowledge extractor, MRSPAKE, showed high performance and scalability.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.10
• /
• pp.397-406
• /
• 2014

In order to answer the questions successfully on behalf of the human in DeepQA environments such as Jeopardy! of the American quiz show, the computer is required to have the capability of fast temporal and spatial reasoning on a large-scale commonsense knowledge base. In this paper, we present a scalable spatial reasoning algorithm for deriving efficiently new directional and topological relations using the MapReduce framework, one of well-known parallel distributed computing environments. The proposed reasoning algorithm assumes as input a large-scale spatial knowledge base including CSD-9 directional relations and RCC-8 topological relations. To infer new directional and topological relations from the given spatial knowledge base, it performs the cross-consistency checks as well as the path-consistency checks on the knowledge base. To maximize the parallelism of reasoning computations according to the principle of the MapReduce framework, we design the algorithm to partition effectively the large knowledge base into smaller ones and distribute them over multiple computing nodes at the map phase. And then, at the reduce phase, the algorithm infers the new knowledge from distributed spatial knowledge bases. Through experiments performed on the sample knowledge base with the MapReduce-based implementation of our algorithm, we proved the high performance of our large-scale spatial reasoner.

• Journal of KIISE
• /
• v.42 no.5
• /
• pp.601-608
• /
• 2015

In order to answer questions successfully on behalf of the human contestant in DeepQA environments such as 'Jeopardy!', the American quiz show, the computer needs to have the capability of fast temporal and spatial reasoning on a large-scale commonsense knowledge base. In this paper, we present a hybrid spatial reasoning algorithm, among various efficient spatial reasoning methods, for handling directional and topological relations. Our algorithm not only improves the query processing time while reducing unnecessary reasoning calculation, but also effectively deals with the change of spatial knowledge base, as it takes a hybrid method that combines forward and backward reasoning. Through experiments performed on the sample spatial knowledge base with the hybrid spatial reasoner of our algorithm, we demonstrated the high performance of our hybrid spatial reasoning algorithm.

• Korean Journal of Cognitive Science
• /
• v.15 no.4
• /
• pp.15-20
• /
• 2004

To develop a cognitive system with the flexibility and breadth of human, it's very important to construct a large scale knowledge base which include commonsense knowledge as well as expert knowledge. Efficient knowledge representation and reasoning techniques will play a key role for this. This paper introduce a cognitive system which is based on Cyc knowledge base and augmented with our work on qualitative and spatial representation and reasoning. Our system has been implemented and tested on various examples.

• KIISE Transactions on Computing Practices
• /
• v.21 no.12
• /
• pp.774-779
• /
• 2015

In this paper, we present the design and implementation of a large-scale qualitative spatial reasoner using Apache Spark, an in-memory high speed cluster computing environment, which is effective for sequencing and iterating component reasoning jobs. The proposed reasoner can not only check the integrity of a large-scale spatial knowledge base representing topological and directional relationships between spatial objects, but also expand the given knowledge base by deriving new facts in highly efficient ways. In general, qualitative reasoning on topological and directional relationships between spatial objects includes a number of composition operations on every possible pair of disjunctive relations. The proposed reasoner enhances computational efficiency by determining the minimal set of disjunctive relations for spatial reasoning and then reducing the size of the composition table to include only that set. Additionally, in order to improve performance, the proposed reasoner is designed to minimize disk I/Os during distributed reasoning jobs, which are performed on a Hadoop cluster system. In experiments with both artificial and real spatial knowledge bases, the proposed Spark-based spatial reasoner showed higher performance than the existing MapReduce-based one.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.2
• /
• pp.103-116
• /
• 2017

In this paper, we present the design and implementation of a large-scale qualitative spatial reasoner, which can derive new qualitative spatial knowledge representing both topological and directional relationships between two arbitrary spatial objects in efficient way using Aparch Spark SQL. Apache Spark SQL is well known as a distributed parallel programming environment which provides both efficient join operations and query processing functions over a variety of data in Hadoop cluster computer systems. In our spatial reasoner, the overall reasoning process is divided into 6 jobs such as knowledge encoding, inverse reasoning, equal reasoning, transitive reasoning, relation refining, knowledge decoding, and then the execution order over the reasoning jobs is determined in consideration of both logical causal relationships and computational efficiency. The knowledge encoding job reduces the size of knowledge base to reason over by transforming the input knowledge of XML/RDF form into one of more precise form. Repeat of the transitive reasoning job and the relation refining job usually consumes most of computational time and storage for the overall reasoning process. In order to improve the jobs, our reasoner finds out the minimal disjunctive relations for qualitative spatial reasoning, and then, based upon them, it not only reduces the composition table to be used for the transitive reasoning job, but also optimizes the relation refining job. Through experiments using a large-scale benchmarking spatial knowledge base, the proposed reasoner showed high performance and scalability.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2786-2796
• /
• 1998

Extraction of interesting and general knowledge from large spatial database is an important task in the development of geographical information system and knowledge-base systems. In this paper, we propose a spatial data mining system using generalization method; In this system, we extend an existing generalization mining and design a rulebase to support deriving new spatial knowledge. For this purpose, we propose an interleaved method which integrates spatial data dominated and nonspatial data dominated mining and construct a rulebase to extract topological relationship between spatial objects.

• Korean Institute of Interior Design Journal
• /
• v.22 no.2
• /
• pp.220-229
• /
• 2013

Recently, the volume of knowledge information in the form of electronic media is quickly increasing in the library field along with the advancement of electronic communication technology. Libraries have both printed data and electronic data and are faced with the issue of corresponding with the access and use of knowledge information in terms of the space. This study is for building the layout of a sustainable knowledge information space based on the view that the library is the official infrastructure of the knowledge information based society. It is intended to analyze the meaning of knowledge information in the modern society, characteristics in the spatial organization and the transmission of knowledge information. The goal of this study is to understand and forecast the spatial structure where users access knowledge information and exchange with one another and developing the direction and guidelines for the spatial plan that today's libraries prefer through this analysis. For this, this study firstly prepared the base for the research on library space which can be considered as the physical realization of such concepts, through the theoretical review about the knowledge information and social concepts as well as characteristics of modern society. Also, it seized the characteristics in the transmission of knowledge information by conducting a structural analysis of the information service such as knowledge information and space, space and information media, space and space through the cases of 10 public libraries. The analysis resulted in basic data including the system of organizing knowledge information, system of knowledge information transferring elements and structure, and layout pattern of each library. These results are deemed meaningful for the promotion of communication with the user through the exchange, creation, and experience of knowledge information, the social role of today's public library.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.2
• /
• pp.63-79
• /
• 2008

With the recent development of advanced GIS and complex spatial analysis technologies, the more sophisticated technologies are being required to support the advanced knowledge for solving geographical or spatial problems in various decision support systems. In addition, necessity for research on scientific crime investigation and forensic science is increasing particularly at law enforcement agencies and investigation institutions for efficient investigation and the prevention of crimes. There are active researches on geographic profiling to predict the base location such as criminals' residence by analyzing the spatial patterns of serial crimes. However, as previous researches on geographic profiling use simply statistical methods for spatial pattern analysis and do not apply a variety of spatial and temporal analysis technologies on serial crimes, they have the low prediction accuracy. Therefore, this paper identifies the typology the spatio-temporal patterns of serial crimes according to spatial distribution of crime sites and temporal distribution on occurrence of crimes and proposes STA-BLP(Spatio-Temporal Analysis based Base Location Prediction) algorithm which predicts the base location of serial crimes more accurately based on the patterns. STA-BLP improves the prediction accuracy by considering of the anisotropic pattern of serial crimes committed by criminals who prefer specific directions on a crime trip and the learning effect of criminals through repeated movement along the same route. In addition, it can predict base location more accurately in the serial crimes from multiple bases with the local prediction for some crime sites included in a cluster and the global prediction for all crime sites. Through a variety of experiments, we proved the superiority of the STA-BLP by comparing it with previous algorithms in terms of prediction accuracy.