• Title/Summary/Keyword: Cluster Tree

Search Result 339, Processing Time 0.027 seconds

Performance Comparison of Keyword Extraction Methods for Web Document Cluster using Suffix Tree Clustering (Suffix Tree를 이용한 웹 문서 클러스터의 제목 생성 방법 성능 비교)

  • 염기종;권영식
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.11a
    • /
    • pp.328-335
    • /
    • 2002
  • 최근 들어 인터넷 기술의 발달로 웹 상에 많은 자료들이 산재해 있습니다. 사용자가 원하는 정보를 검색하기 위해서 키워드 검색을 이용하고 있는데 이러한 키워드 검색은 사용자들이 입력한 단편적인 정보에 바탕하여 검색하고 검색된 결과들을 자체적인 기준으로 순위를 매겨 나열식으로 제시하고 있다. 이러한 경우 사용자들의 생각과는 다르게 결과가 제시될 수 있다. 따라서 사용자들의 검색 시간을 줄이고 편리하게 검색하기 위한 환경의 필요성이 높아지고 있다. 본 논문에서는 Suffix Tree 알고리즘을 사용하여 관련있는 문서들을 분류하고 각각의 분류된 클러스터에 제목을 생성하기 위하여 문서 빈도수, 단어 빈도수와 역문서 빈도수, 카이 검정, 공통 정보, 엔트로피 방법을 비교 평가하여 제목을 생성하는데 어떠한 방법이 가장 효과적인지 알아보기 위해 비교 평가해본 결과 문서빈도수가 TF-IDF보다 약 10%정도 성능이 좋은 결과를 보여주었다.

  • PDF

Automatic Construction of Reduced Dimensional Cluster-based Keyword Association Networks using LSI (LSI를 이용한 차원 축소 클러스터 기반 키워드 연관망 자동 구축 기법)

  • Yoo, Han-mook;Kim, Han-joon;Chang, Jae-young
    • Journal of KIISE
    • /
    • v.44 no.11
    • /
    • pp.1236-1243
    • /
    • 2017
  • In this paper, we propose a novel way of producing keyword networks, named LSI-based ClusterTextRank, which extracts significant key words from a set of clusters with a mutual information metric, and constructs an association network using latent semantic indexing (LSI). The proposed method reduces the dimension of documents through LSI, decomposes documents into multiple clusters through k-means clustering, and expresses the words within each cluster as a maximal spanning tree graph. The significant key words are identified by evaluating their mutual information within clusters. Then, the method calculates the similarities between the extracted key words using the term-concept matrix, and the results are represented as a keyword association network. To evaluate the performance of the proposed method, we used travel-related blog data and showed that the proposed method outperforms the existing TextRank algorithm by about 14% in terms of accuracy.

Effect of Shade Levels on Growth and Fruit Blight of 'Campbell Early' Grapes (포도 '캠벨얼리' 차광수준이 수체생장과 열매마름 증상에 미치는 영향)

  • Kim, Byeong-Sam;Cho, Kyung-Chul;Hwang, In-Taek;Choi, Hyun-Sug;Jung, Seok-Kyu
    • Korean Journal of Organic Agriculture
    • /
    • v.27 no.1
    • /
    • pp.45-56
    • /
    • 2019
  • The study I was initiated in six private 'Campbell Early' vineyards in parts of Jeollanam-do province to relieve symptom of fruit blight mostly due to a high temperature occurred in Summer. High percentage of fruit blight was observed for medium growth of grape trees non-irrigated. In the study II, grape trees treated with 0%, 30% and 60% shade films were investigated for the tree responses, including fruit blight symptom in the research plots. Harvesting time was advanced approximately two weeks by the 30% shade treatment. High percentage of shades increased total shoot length per tree and decreased shoot diameter, with the greatest number of shoots observed for the 30% shade-treated grapes. Light intensity in the tree canopy was approximately 26% decreased by 30% shade treatment. Marketable harvested fruits per tree were 50.6 of 30% shade treatment, 33.6 of 0% shade, and 42.8 of 60% shade. The 30% shade treatment decreased to 11.8% of cluster blight per tree and to 11.2% of berry blight per cluster. The 30% shade treatment increased cluster weight, berry weight, soluble solid contents, and anthocyanin contents.

A Novel K-hop Cluster-based Ad hoc Routing Scheme with Delegation Functions (위임 기능을 이용한 새로운 K-hop 클러스터 기반 Ad hoc 라우팅 구조)

  • Kim Tae-yeon;Wang Ki-cheoul
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.27-37
    • /
    • 2004
  • The existing ad hoc network protocols suffer the scalability problem due to the inherent characteristics of node mobility. Cluster-based routing protocols divide the member nodes into a set of clusters and perform a hierarchical routing between these clusters. This hierarchical feature help to improve the scalability of ad hoc network routing. However, previous k-hop cluster-based routing protocols face another problems, that is, control overhead of the cluster headers. This paper proposes a novel k-hop cluster-based routing scheme with delegation functions for mobile ad hoc networks. The scheme employs is based on tree topology to manage cluster members in effectively. The cluster headers do not manage the routing table for whole members, while the header keeps the routing table for its neighbor members and the member list for one hop over nodes within k-hop cluster. Then the in-between leveled nodes manage the nested nodes which is structured in the lower level. Therefore, the proposed mechanism can reduce some control overhead of the cluster leaders.

  • PDF

Unusual data local access using inverse order tree (역순트리를 이용한 특이데이터 국소적 접근)

  • Rim, Kwang-Cheol;Seol, Jung-Ja
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.3
    • /
    • pp.595-601
    • /
    • 2014
  • With the advent of the Smart information-communication era, the number of data has increased exponentially. Accordingly, figuring out and analyzing in which area and circumstance the data has been created becomes one of the factors for prompt actions. In this paper identifies how to analyze the data by implementing a route from the lowest module to highest one in an inverse order for the part judgement for the particular data. The script first identifies cluster analisys, paralizes the analysis using the sum of each factors of the cluster with the tree structure, and finally transpose the answer into number. Also, it is designed to place priority on particular answer, thereafter, draws the wanted answer real-time.

STO-based Cluster Header Election Algorithm (STO 기반 클러스터 헤더 선출 알고리즘)

  • Yoon, Jeong-Hyeon;Lee, Heon-Guk;Kim, Seung-Ku
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.587-590
    • /
    • 2019
  • This paper is about to improve the network life's reduction due to the deviation of sensor node and frequently change of network, the main problem of sensor network. The existing Scalable Topology Organization(STO)-based ZigBee Tree Topology Control Algorithm did not consider ways to consume power so the network lifetime is too short. Accordingly, per each round, electing a new parent node and consisting of the new network topology technique, The Cluster Header Selection, extending the network's overall lifetime. The OMNet++ Simulator yielded results from the existing STO Algorithm and the proposed Cluster Header Selection Technique in the same experimental environment, which resulted in an increase in overall network life by about 40% and an improvement of about 10% in performance in the remaining portion of the battery.

  • PDF

Recommendation of Optimal Treatment Method for Heart Disease using EM Clustering Technique

  • Jung, Yong Gyu;Kim, Hee Wan
    • International Journal of Advanced Culture Technology
    • /
    • v.5 no.3
    • /
    • pp.40-45
    • /
    • 2017
  • This data mining technique was used to extract useful information from percutaneous coronary intervention data obtained from the US public data homepage. The experiment was performed by extracting data on the area, frequency of operation, and the number of deaths. It led us to finding of meaningful correlations, patterns, and trends using various algorithms, pattern techniques, and statistical techniques. In this paper, information is obtained through efficient decision tree and cluster analysis in predicting the incidence of percutaneous coronary intervention and mortality. In the cluster analysis, EM algorithm was used to evaluate the suitability of the algorithm for each situation based on performance tests and verification of results. In the cluster analysis, the experimental data were classified using the EM algorithm, and we evaluated which models are more effective in comparing functions. Using data mining technique, it was identified which areas had effective treatment techniques and which areas were vulnerable, and we can predict the frequency and mortality of percutaneous coronary intervention for heart disease.

Pruning the Boosting Ensemble of Decision Trees

  • Yoon, Young-Joo;Song, Moon-Sup
    • Communications for Statistical Applications and Methods
    • /
    • v.13 no.2
    • /
    • pp.449-466
    • /
    • 2006
  • We propose to use variable selection methods based on penalized regression for pruning decision tree ensembles. Pruning methods based on LASSO and SCAD are compared with the cluster pruning method. Comparative studies are performed on some artificial datasets and real datasets. According to the results of comparative studies, the proposed methods based on penalized regression reduce the size of boosting ensembles without decreasing accuracy significantly and have better performance than the cluster pruning method. In terms of classification noise, the proposed pruning methods can mitigate the weakness of AdaBoost to some degree.

Cosmological N-body simulations for Intracluster Light using the Galaxy Repacement Technique

  • Chun, Kyungwon;Shin, Jihye;Smith, Rory;Ko, Jongwan;Yoo, Jaewon
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.46 no.1
    • /
    • pp.29.2-29.2
    • /
    • 2021
  • Intracluster light (ICL) is composed of the stars diffused throughout the galaxy cluster but does not bound to any galaxy. The ICL is a ubiquitous feature of galaxy clusters and occupies a significant fraction of the total stellar mass in the cluster. Therefore, the ICL components are believed to help understand the formation and evolution of the clusters. However, in the numerical study, one needs to perform the high-resolution cosmological hydrodynamic simulations, which require an expensive calculation, to trace these low-surface brightness structures (LSB). Here, we introduce the Galaxy Replacement Technique (GRT) that focuses on implementing the gravitational evolution of the diffused ICL structures without the expensive baryonic physics. The GRT reproduces the ICL structures by a multi-resolution cosmological N-body re-simulation using a full merger tree of the cluster from a low-resolution DM-only cosmological simulation and an abundance matching model. Using the GRT, we show the preliminary results about the evolution of the ICL in the on-going simulations for the various clusters.

  • PDF

Deriving Suitable Place for Forestation by Ecological Environment Analysis of Multi-use Tree Species in Chungbuk Province (다용도 수종의 생태환경 분석에 의한 조림적지 도출)

  • Shin, Chang-Seob
    • Korean Journal of Plant Resources
    • /
    • v.19 no.4
    • /
    • pp.555-561
    • /
    • 2006
  • This study was carried out to investigate the suitable place for growth by analyzing the ecological environment of multi-use tree species to be spontaneous in Chungbuk Province, and derive the suitable place for forestation. At the test of the independence of multi-use tree species, as the significant correlation of the other tree species except Quercus acutissima - Zanthoxylum schinifolium was different by the survey location, it is concluded that the share relation of the ecological niche among tree species is largely influenced not only by the affinity of tree species but the growth environment. As the result of the correlation analysis between environment factors and tree clusters, it was analyzed that tree clusters were much influenced by the topography and the altitude among the variable environment factors; the topography, altitude, the direction of hillside, the slope and the number of tree species appearing. It was investigated that the cluster of Acer mono - Betula costata was distributed to the valley from low hillside to have high altitude, and the clusters of Kalopanax pictus - Ulmus davidiana var. japonica and Fraxinus rhynchophylla - Rhus trichocarpa were sporadically distributed to broad location because their geographical adaptation powers are high.