• Title/Summary/Keyword: Hierarchical information space

Search Result 140, Processing Time 0.037 seconds

A Semantic Aspect-Based Vector Space Model to Identify the Event Evolution Relationship within Topics

  • Xi, Yaoyi;Li, Bicheng;Liu, Yang
    • Journal of Computing Science and Engineering
    • /
    • v.9 no.2
    • /
    • pp.73-82
    • /
    • 2015
  • Understanding how the topic evolves is an important and challenging task. A topic usually consists of multiple related events, and the accurate identification of event evolution relationship plays an important role in topic evolution analysis. Existing research has used the traditional vector space model to represent the event, which cannot be used to accurately compute the semantic similarity between events. This has led to poor performance in identifying event evolution relationship. This paper suggests constructing a semantic aspect-based vector space model to represent the event: First, use hierarchical Dirichlet process to mine the semantic aspects. Then, construct a semantic aspect-based vector space model according to these aspects. Finally, represent each event as a point and measure the semantic relatedness between events in the space. According to our evaluation experiments, the performance of our proposed technique is promising and significantly outperforms the baseline methods.

A Performance Improvement Study On Hierarchical Clustering (Centroid Linkage) Using A Priority Queue (Priority Queue 를 이용한 Hierarchical Clustering (Centroid Linkage) 성능 개선)

  • Jeon, Yongkweon;Yoon, Sungroh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1837-1838
    • /
    • 2010
  • 기존 hierarchical clustering 은 Time complexity 와 space complexity 가 Large data set 을 clustering 하기에는 적당하지 못하며 이것을 일반 PC 의 메모리 내에서 해결하는데 어려움이 있다. 따라서 본 연구에서는 이러한 어려움을 극복하기 위해 기존 Hierarchical clustering 중 Centroid Linkage 에 새로운 Algorithm 을 제안하여 보다 적은 메모리를 사용하고 빠르게 처리하는 방법을 제안하고자 한다.

K-Anonymity using Hierarchical Structure in Indoor Space (실내공간에서 계층 구조를 이용한 K-익명화)

  • Kim, Joon-Seok;Li, Ki-Joune
    • Spatial Information Research
    • /
    • v.20 no.4
    • /
    • pp.93-101
    • /
    • 2012
  • Due to complexity of indoor space, the demand of Location Based Services (LBS) in indoor space is increasing as well as outdoor. However, it includes privacy problems of exposing personal location. Location K-anonymity technology is a method to solve the privacy problems with cloaking their locations by Anonymized Spatial Region(ASR). It guarantees K users within a region containing the location of a given user. However previous researches have dealt the problems based on Euclidean distance in outdoor space, and cannot be applied in indoor space where there are constraints of movement such as walls. For this reason, we propose in this paper a K-anonymity for cloaking indoor location in consideration of structures and representation of indoor space. The basic concept of our approach is to introduce a hierarchical structure as ASR for including K-1 users for cloaking their locations. We also proposed a cost model by K and attributes of hierarchical structure to analyze the performance of the method.

A Hierarchical Autonomous System Based Topology Control Algorithm in Space Information Network

  • Zhang, Wei;Zhang, Gengxin;Gou, Liang;Kong, Bo;Bian, Dongming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3572-3593
    • /
    • 2015
  • This article investigates the topology control problem in the space information network (SIN) using a hierarchical autonomous system (AS) approach. We propose an AS network topology control (AS-TC) algorithm to minimize the time delay in the SIN. Compared with most existing approaches for SIN where either the purely centralized or the purely distributed control method is adopted, the proposed algorithm is a hybrid control method. In order to reduce the cost of control, the control message exchange is constrained among neighboring sub-AS networks. We prove that the proposed algorithm achieve logical k-connectivity on the condition that the original physical topology is k-connectivity. Simulation results validate the theoretic analysis and effectiveness of the AS-TC algorithm.

A Color Navigation System for Effective Perceived Structure: Focused on Hierarchical Menu Structure in Small Display (지각된 정보구조의 효과적 형성을 위한 색공간 네비게이션 시스템 연구 - 작은 디스플레이 화면상의 위계적 정보구조를 중심으로 -)

  • 경소영;박경욱;박준아;김진우
    • Archives of design research
    • /
    • v.15 no.3
    • /
    • pp.167-180
    • /
    • 2002
  • This study investigates effective ways to help users form a correct mental model of the hierarchical information space (HIS) in small display. The focus is the effect of color cue on understanding the structure and navigating the information space. The concept of color space (CS) corresponds well to the HIS - one color has a unique position in the CS as a piece of information does in HIS. In this study, we empirically examined two types of color cue, namely, categorical and depth cue. Hue was used as a categorical cue and tone was used as a depth cue. In our experiment, we evaluate the effectiveness of the color cues in the mobile internet system. Subjects were asked to perform four searching tasks and four comparison tasks. The results of experiment reveal that the categorical cues significantly improve the user's mental model whereas decrease navigation performances. The depth cues cannot aid in understanding the HIS as well as improve navigation performances. This study concludes with limitations of the study and descriptions of future studies.

  • PDF

ALL POSSIBLE HIERARCHICAL QUADRATIC REGRESSIONS FOR RESPONSE SURFACES

  • KIM SUNG-SOO;KWON SOON-SUN;PARK SUNG-HYUN
    • Journal of the Korean Statistical Society
    • /
    • v.34 no.3
    • /
    • pp.209-218
    • /
    • 2005
  • In response surfaces analysis, we often proceed by supposing that, over a limited region of factor space, a polynomial of only first or second degree might adequately approximate the true function. To find the best subset model, all possible quadratic regressions for response surfaces can be very valuable to get optimum solutions under some reasonable experimentations. However, there is a very hard computational burden to get all possible quadratic regressions. In practice, it is sufficient to consider only hierarchical models. In this paper, we propose an algorithm to get all possible hierarchical quadratic regressions for fitting response surfaces.

Study on Competitive Factors of Tourism Resources for Establishment of Jeju Health Tourism Model - Focusing on the Hierarchical Space Based on Medical Interference - (제주 헬스투어리즘 모델 정립을 위한 관광자원 경쟁요인 분석 - 의료간섭 기반 위계공간을 중심으로 -)

  • KIM, Hyo;JEONG, Heonkyu;KIM, Mincheol;CHOI, Yong-Bok
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.24 no.2
    • /
    • pp.29-39
    • /
    • 2021
  • The global aging phenomenon and new lifestyles have a worldwide attention to the new tourism form of health tourism. The purpose of this study is to analyze and suggest the competitive types of health tourism. Through the literature review, the theoretical base on the concept and type of health tourism and hierarchical spatial types such as medical space, semi-medical space, non-medical space, and natural healing space, based on medical intervention was established. A questionnaire survey was conducted for the professionals in Jeju area about tourism, health care, policy. As a result of analysis based on competitiveness advantage factors of Jeju health tourism, Jeju health tourism was confirmed to have higher importance in the natural healing space than the health service center space. Three kinds of resources such as natural resources, healing resources, and active resources of Jeju type health tourism were derived and applied to two hierarchical spaces, natural healing space and non-medical healing space, based on medical intervention.

Enhancing Retrieval Performance for Hierarchical Compact Binary Tree (계층형 집약 이진 트리의 검색 성능 개선)

  • Kim, Sung Wan
    • Journal of Creative Information Culture
    • /
    • v.5 no.3
    • /
    • pp.345-353
    • /
    • 2019
  • Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.

Text Categorization for Authorship based on the Features of Lingual Conceptual Expression

  • Zhang, Quan;Zhang, Yun-liang;Yuan, Yi
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2007.11a
    • /
    • pp.515-521
    • /
    • 2007
  • The text categorization is an important field for the automatic text information processing. Moreover, the authorship identification of a text can be treated as a special text categorization. This paper adopts the conceptual primitives' expression based on the Hierarchical Network of Concepts (HNC) theory, which can describe the words meaning in hierarchical symbols, in order to avoid the sparse data shortcoming that is aroused by the natural language surface features in text categorization. The KNN algorithm is used as computing classification element. Then, the experiment has been done on the Chinese text authorship identification. The experiment result gives out that the processing mode that is put forward in this paper achieves high correct rate, so it is feasible for the text authorship identification.

  • PDF

A Study on Facility Information System using GIS and Semantic Web in Underground Space

  • Cui, Yulan;Hwang, Hyun-Suk;Kim, Chang-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.12
    • /
    • pp.1843-1854
    • /
    • 2010
  • The utilization of underground space has recently increased with the complication of road, the rise of the land price, and the development of green technology. Underground space ranges from classical excavations to subway, underground cities, and shopping malls where there are crowds of people. At this time, government has spent a lot of money in installing various types of safety facilities for preparations of increasing potential disasters. Therefore, an effective facility management system is required. In this paper, we propose an information retrieval process to effectively extract the facilities' information based on the ontology and spatial analysis in underground space. The ontology-based searching supports hierarchical and associated results as well as knowledge sharing with hierarchy concepts. The spatial analysis based searching has "Buffer" and "Near" functions to operate on a map without understanding any property of the facility information.