• Title/Summary/Keyword: hierarchy clustering

Search Result 129, Processing Time 0.024 seconds

A Three Schematic Analysis of Information Visualization (정보시각화에 대한 스킴모형별 비교 분석)

  • Seo, Eun-Kyoung
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.36 no.4
    • /
    • pp.175-205
    • /
    • 2002
  • Information visualization in information retrieval is a creating tool that enables us to observe, manipulate, search, navigate, explore, filter, discover, understand, interact with large volumes of data for more rapidly and far more effectively to discover hidden patterns. The focus of this study is to investigate and analyze information visualization techniques in information retrieval system in the three-schematic levels. In result, it was found that first, scientific data, documents, and retrieval result information are visualized through various techniques. Second, information visualization techniques which facilitate navigation and interaction are zoom and pan, focus+context techniques, incremental exploration, and clustering. Third, the visual metaphors used by the visualization systems are presented in the linear structure, hierarchy structure, network structure, and vector scatter structure.

Research on Function and Policy for e-Government System using Semantic Technology (전자정부내 의미기반 기술 도입에 따른 기능 및 정책 연구)

  • Jang, Young-Cheol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.5
    • /
    • pp.22-28
    • /
    • 2008
  • This paper aims to offer a solution based on semantic document classification to improve e-Government utilization and efficiency for people using their own information retrieval system and linguistic expression. Generally, semantic document classification method is an approach that classifies documents based on the diverse relationships between keywords in a document without fully describing hierarchial concepts between keywords. Our approach considers the deep meanings within the context of the document and radically enhances the information retrieval performance. Concept Weight Document Classification(CoWDC) method, which goes beyond using existing keyword and simple thesaurus/ontology methods by fully considering the concept hierarchy of various concepts is proposed, experimented, and evaluated. With the recognition that in order to verify the superiority of the semantic retrieval technology through test results of the CoWDC and efficiently integrate it into the e-Government, creation of a thesaurus, management of the operating system, expansion of the knowledge base and improvements in search service and accuracy at the national level were needed.

  • PDF

Classification and Retrieval of Object - Oriented Reuse Components with HACM (HACM을 사용한 객체지향 재사용 부품의 분류와 검색)

  • Bae, Je-Min;Kim, Sang-Geun;Lee, Kyung-Whan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1733-1748
    • /
    • 1997
  • In this paper, we propose the classification scheme and retrieval mechanism which can apply to many application domains in order to construct the software reuse library. Classification scheme which is the core of the accessibility in the reusability, is defined by the hierarchical structure using the agglomerative clusters. Agglomerative cluster means the group of the reuse component by the functional relationships. Functional relationships are measured by the HACM which is the representation method about software components to calculate the similarities among the classes in the particular domain. And clustering informations are added to the library structure which determines the functionality and accuracy of the retrieval system. And the system stores the classification results such as the index information with the weights, the similarity matrix, the hierarchical structure. Therefore users can retrieve the software component using the query which is the natural language. The thesis is studied to focus on the findability of software components in the reuse library. As a result, the part of the construction process of the reuse library was automated, and we can construct the object-oriented reuse library with the extendibility and relationship about the reuse components. Also the our process is visualized through the browse hierarchy of the retrieval environment, and the retrieval system is integrated to the reuse system CARS 2.1.

  • PDF

A Life time improvement Method of SVM application LEACH protocol in Wireless Sensor Networks (SVM을 적용한 LEACH 프로토콜 기반 무선센서네트워크의 수명 개선 방법)

  • Pyo, Se Jun;Jo, Yong-Ok;Ok, Tae-Seong;Bang, Jong-Dae;Keshav, Tushar;Lee, Seong-Ho;Ryu, Hui-Eun;Lee, Yeonwoo;Bae, Jinsoo;Lee, Seong-Ro
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.606-608
    • /
    • 2011
  • 무선 센서 네트워크는 특정지역에 센서 노드를 설치하여 주변 정보 또는 특정 목적의 데이터를 수집하고, 그 정보를 수집하는 싱크(Sink)로 구성되어 있다. 무선 센서 네트워크의 수명은 망을 구성하는 센서 노드의 베터리 소비에 따라 수명이 결정 되고 하나의 노드가 죽기 시작하면서부터 급격하게 센서 노드의 베터리 소비가 커져 빠르게 죽는다. 무선 센서 네트워크를 구성하는 센서노드는 라우팅, 센싱을 수행하기 때문에 베터리 소비에 많은 부담을 가지고 있다. 본 논문은 무선 센서 네트워크의 대표적 클러스터링 기반 라우팅 기법인 LEACH(Low - Energy Adaptive Clustering Hierarchy)프로토콜에 SVM(Support Vector Machine)을 적용하여 센서노드의 균형적인 베터리 소비로 망을 효율적으로 관리하고 망의 수명을 개선 할 수 있는 방법을 제안 한다. 이러한 센서 노드의 균형적인 베터리 소비로 무선센서 네트워크의 수명을 개선 한다. 실험결과 기존의 LEACH 프로토콜보다 우수한 성능을 보인다.

Development of Multidimensional Analysis System for Bio-pathways (바이오 패스웨이 다차원 분석 시스템 개발)

  • Seo, Dongmin;Choi, Yunsoo;Jeon, Sun-Hee;Lee, Min-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.11
    • /
    • pp.467-475
    • /
    • 2014
  • With the development of genomics, wearable device and IT/NT, a vast amount of bio-medical data are generated recently. Also, healthcare industries based on big-data are booming and big-data technology based on bio-medical data is rising rapidly as a core technology for improving the national health and aged society. A pathway is the biological deep knowledge that represents the relations of dynamics and interaction among proteins, genes and cells by a network. A pathway is wildly being used as an important part of a bio-medical big-data analysis. However, a pathway analysis requires a lot of time and effort because a pathway is very diverse and high volume. Also, multidimensional analysis systems for various pathways are nonexistent even now. In this paper, we proposed a pathway analysis system that collects user interest pathways from KEGG pathway database that supports the most widely used pathways, constructs a network based on a hierarchy structure of pathways and analyzes the relations of dynamics and interaction among pathways by clustering and selecting core pathways from the network. Finally, to verify the superiority of our pathway analysis system, we evaluate the performance of our system in various experiments.

A New Routing Algorithm for Performance improvement of Wireless Sensor Networks (무선 센서 네트워크의 성능 향상을 위한 새로운 라우팅 알고리즘)

  • Yang, Hyun-Suk;Kim, Do-Hyung;Park, Joon-Yeol;Lee, Tae-Bong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.1
    • /
    • pp.39-45
    • /
    • 2012
  • In this paper, a distributed 2-hop routing algorithm is proposed. The main purpose of the proposed algorithm is to reduce the overall power consumption of each sensor node so that the lifetime of WSN(wireless sensor network) is prolonged. At the beginning of each round, the base station transmits a synchronization signal that contains information on the priority table that is used to decide whether each sensor node is elected as a cluster head or not. The priority table is constructed so that sensor nodes closer to half energy distance from the base station get the higher priority. 2-hop routing is done as follows. Cluster heads inside half energy distance from the base station communicate with the base station directly. Those outside half energy distance have to decide whether they choose 2-hop routing or 1-hop routing. To do this, each cluster head outside half energy distance calculates the energy consumption needed to communicate with the base station via 1-level cluster head or directly. If less energy is needed when passing through the 1-level cluster head, 2-hop routing is chosen and if not, 1-hop routing is chosen. After routing is done each sensor nodes start sensing data.

Environmental monitoring system research based on low-power sensor network (저전력 센서네트워크 기반 환경모니터링 시스템 연구)

  • Kim, Ki-Tae;Kim, Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.807-810
    • /
    • 2011
  • The sensor network technology for core technology of ubiquitous computing is in the spotlight recently, the research on sensor network is proceeding actively which is composed many different sensor node. USN(Ubiquitous Sensor Network) is the network that widely applies for life of human being. It works out to sense, storage, process, deliver every kind of appliances and environmental information from the stucktags and sensors. And it is possible to utilize to measure and monitor about the place of environmental pollution which is difficult for human to install. It's studied constantly since it be able to compose easily more subminiature, low-power, low-cost than previous one. And also it spotlights an important field of study, graft the green IT and IT of which the environment and IT unite stragically onto the Network. The problem for the air pollution in the office or the indoor except a specific working area is the continuously issue since the human beings have lived in the dwelling facilities. Measures for that problem are urgently needed. It's possible to solve for the freshair of outside with enough ventilation but that is the awkward situation to be managed by person. This study is the system engineering to management for indoor air condition under the sensor network. And research for efficiently manage an option.

  • PDF

The Algorithm for an Energy-efficient Particle Sensor Applied LEACH Routing Protocol in Wireless Sensor Networks (무선센서네트워크에서 LEACH 라우팅 프로토콜을 적용한 파티클 센서의 에너지 효율적인 알고리즘)

  • Hong, Sung-Hwa;Kim, Hoon-Ki
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.13-21
    • /
    • 2009
  • The sensor nodes that form a wireless sensor network must perform both routing and sensing roles, since each sensor node always has a regular energy drain. The majority of sensors being used in wireless sensor networks are either unmanned or operated in environments that make them difficult for humans to approach. Furthermore, since many wireless sensor networks contain large numbers of sensors, thus requiring the sensor nodes to be small in size and cheap in price, the amount of power that can be supplied to the nodes and their data processing capacity are both limited. In this paper, we proposes the WSN(Wireless Sensor Network) algorithm which is applied sensor node that has low power consumption and efficiency measurement. Moreover, the efficiency routing protocol is proposed in this paper. The proposed algorithm reduces power consumption of sensor node data communication. It has not researched in LEACH(Low-Energy Adaptive Clustering Hierarchy) routing protocol. As controlling the active/sleep mode based on the measured data by sensor node, the energy consumption is able to be managed. In the event, the data is transferred to the local cluster head already set. The other side, this algorithm send the data as dependent on the information such as initial and present energy, and the number of rounds that are transformed into cluster header and then transferred. In this situation, the assignment of each node to cluster head evenly is very important. We selected cluster head efficiently and uniformly distributed the energy to each cluster node through the proposed algorithm. Consequently, this caused the extension of the WSN life time.

An Expert System for the Estimation of the Growth Curve Parameters of New Markets (신규시장 성장모형의 모수 추정을 위한 전문가 시스템)

  • Lee, Dongwon;Jung, Yeojin;Jung, Jaekwon;Park, Dohyung
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.17-35
    • /
    • 2015
  • Demand forecasting is the activity of estimating the quantity of a product or service that consumers will purchase for a certain period of time. Developing precise forecasting models are considered important since corporates can make strategic decisions on new markets based on future demand estimated by the models. Many studies have developed market growth curve models, such as Bass, Logistic, Gompertz models, which estimate future demand when a market is in its early stage. Among the models, Bass model, which explains the demand from two types of adopters, innovators and imitators, has been widely used in forecasting. Such models require sufficient demand observations to ensure qualified results. In the beginning of a new market, however, observations are not sufficient for the models to precisely estimate the market's future demand. For this reason, as an alternative, demands guessed from those of most adjacent markets are often used as references in such cases. Reference markets can be those whose products are developed with the same categorical technologies. A market's demand may be expected to have the similar pattern with that of a reference market in case the adoption pattern of a product in the market is determined mainly by the technology related to the product. However, such processes may not always ensure pleasing results because the similarity between markets depends on intuition and/or experience. There are two major drawbacks that human experts cannot effectively handle in this approach. One is the abundance of candidate reference markets to consider, and the other is the difficulty in calculating the similarity between markets. First, there can be too many markets to consider in selecting reference markets. Mostly, markets in the same category in an industrial hierarchy can be reference markets because they are usually based on the similar technologies. However, markets can be classified into different categories even if they are based on the same generic technologies. Therefore, markets in other categories also need to be considered as potential candidates. Next, even domain experts cannot consistently calculate the similarity between markets with their own qualitative standards. The inconsistency implies missing adjacent reference markets, which may lead to the imprecise estimation of future demand. Even though there are no missing reference markets, the new market's parameters can be hardly estimated from the reference markets without quantitative standards. For this reason, this study proposes a case-based expert system that helps experts overcome the drawbacks in discovering referential markets. First, this study proposes the use of Euclidean distance measure to calculate the similarity between markets. Based on their similarities, markets are grouped into clusters. Then, missing markets with the characteristics of the cluster are searched for. Potential candidate reference markets are extracted and recommended to users. After the iteration of these steps, definite reference markets are determined according to the user's selection among those candidates. Then, finally, the new market's parameters are estimated from the reference markets. For this procedure, two techniques are used in the model. One is clustering data mining technique, and the other content-based filtering of recommender systems. The proposed system implemented with those techniques can determine the most adjacent markets based on whether a user accepts candidate markets. Experiments were conducted to validate the usefulness of the system with five ICT experts involved. In the experiments, the experts were given the list of 16 ICT markets whose parameters to be estimated. For each of the markets, the experts estimated its parameters of growth curve models with intuition at first, and then with the system. The comparison of the experiments results show that the estimated parameters are closer when they use the system in comparison with the results when they guessed them without the system.