• Title/Summary/Keyword: Tree algorithm

Search Result 1,720, Processing Time 0.033 seconds

Content-based Image Retrieval System (내용기반 영상검색 시스템)

  • Yoo, Hun-Woo;Jang, Dong-Sik;Jung, She-Hwan;Park, Jin-Hyung;Song, Kwang-Seop
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.4
    • /
    • pp.363-375
    • /
    • 2000
  • In this paper we propose a content-based image retrieval method that can search large image databases efficiently by color, texture, and shape content. Quantized RGB histograms and the dominant triple (hue, saturation, and value), which are extracted from quantized HSV joint histogram in the local image region, are used for representing global/local color information in the image. Entropy and maximum entry from co-occurrence matrices are used for texture information and edge angle histogram is used for representing shape information. Relevance feedback approach, which has coupled proposed features, is used for obtaining better retrieval accuracy. Simulation results illustrate the above method provides 77.5 percent precision rate without relevance feedback and increased precision rate using relevance feedback for overall queries. We also present a new indexing method that supports fast retrieval in large image databases. Tree structures constructed by k-means algorithm, along with the idea of triangle inequality, eliminate candidate images for similarity calculation between query image and each database image. We find that the proposed method reduces calculation up to average 92.9 percent of the images from direct comparison.

  • PDF

Recommendation of Personalized Surveillance Interval of Colonoscopy via Survival Analysis (생존분석을 이용한 맞춤형 대장내시경 검진주기 추천)

  • Gu, Jayeon;Kim, Eun Sun;Kim, Seoung Bum
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.2
    • /
    • pp.129-137
    • /
    • 2016
  • A colonoscopy is important because it detects the presence of polyps in the colon that can lead to colon cancer. How often one needs to repeat a colonoscopy may depend on various factors. The main purpose of this study is to determine personalized surveillance interval of colonoscopy based on characteristics of patients including their clinical information. The clustering analysis using a partitioning around medoids algorithm was conducted on 625 patients who had a medical examination at Korea University Anam Hospital and found several subgroups of patients. For each cluster, we then performed survival analysis that provides the probability of having polyps according to the number of days until next visit. The results of survival analysis indicated that different survival distributions exist among different patients' groups. We believe that the procedure proposed in this study can provide the patients with personalized medical information about how often they need to repeat a colonoscopy.

Sentiment Analysis using Latent Structural SVM (잠재 구조적 SVM을 활용한 감성 분석기)

  • Yang, Seung-Won;Lee, Changki
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.5
    • /
    • pp.240-245
    • /
    • 2016
  • In this study, comments on restaurants, movies, and mobile devices, as well as tweet messages regardless of specific domains were analyzed for sentimental information content. We proposed a system for extraction of objects (or aspects) and opinion words from each sentence and the subsequent evaluation. For the sentiment analysis, we conducted a comparative evaluation between the Structural SVM algorithm and the Latent Structural SVM. As a result, the latter showed better performance and was able to extract objects/aspects and opinion words using VP/NP analyzed by the dependency parser tree. Lastly, we also developed and evaluated the sentiment detector model for use in practical services.

A sequential outlier detecting method using a clustering algorithm (군집 알고리즘을 이용한 순차적 이상치 탐지법)

  • Seo, Han Son;Yoon, Min
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.4
    • /
    • pp.699-706
    • /
    • 2016
  • Outlier detection methods without performing a test often do not succeed in detecting multiple outliers because they are structurally vulnerable to a masking effect or a swamping effect. This paper considers testing procedures supplemented to a clustering-based method of identifying the group with a minority of the observations as outliers. One of general steps is performing a variety of t-test on individual outlier-candidates. This paper proposes a sequential procedure for searching for outliers by changing cutoff values on a cluster tree and performing a test on a set of outlier-candidates. The proposed method is illustrated and compared to existing methods by an example and Monte Carlo studies.

Implementing Linear Models in Genetic Programming to Utilize Accumulated Data in Shipbuilding (조선분야의 축적된 데이터 활용을 위한 유전적프로그래밍에서의 선형(Linear) 모델 개발)

  • Lee, Kyung-Ho;Yeun, Yun-Seog;Yang, Young-Soon
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.42 no.5 s.143
    • /
    • pp.534-541
    • /
    • 2005
  • Until now, Korean shipyards have accumulated a great amount of data. But they do not have appropriate tools to utilize the data in practical works. Engineering data contains experts' experience and know-how in its own. It is very useful to extract knowledge or information from the accumulated existing data by using data mining technique This paper treats an evolutionary computation based on genetic programming (GP), which can be one of the components to realize data mining. The paper deals with linear models of GP for the regression or approximation problem when given learning samples are not sufficient. The linear model, which is a function of unknown parameters, is built through extracting all possible base functions from the standard GP tree by utilizing the symbolic processing algorithm. In addition to a standard linear model consisting of mathematic functions, one variant form of a linear model, which can be built using low order Taylor series and can be converted into the standard form of a polynomial, is considered in this paper. The suggested model can be utilized as a designing tool to predict design parameters with small accumulated data.

Bayesian Rules Based Optimal Defense Strategies for Clustered WSNs

  • Zhou, Weiwei;Yu, Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5819-5840
    • /
    • 2018
  • Considering the topology of hierarchical tree structure, each cluster in WSNs is faced with various attacks launched by malicious nodes, which include network eavesdropping, channel interference and data tampering. The existing intrusion detection algorithm does not take into consideration the resource constraints of cluster heads and sensor nodes. Due to application requirements, sensor nodes in WSNs are deployed with approximately uncorrelated security weights. In our study, a novel and versatile intrusion detection system (IDS) for the optimal defense strategy is primarily introduced. Given the flexibility that wireless communication provides, it is unreasonable to expect malicious nodes will demonstrate a fixed behavior over time. Instead, malicious nodes can dynamically update the attack strategy in response to the IDS in each game stage. Thus, a multi-stage intrusion detection game (MIDG) based on Bayesian rules is proposed. In order to formulate the solution of MIDG, an in-depth analysis on the Bayesian equilibrium is performed iteratively. Depending on the MIDG theoretical analysis, the optimal behaviors of rational attackers and defenders are derived and calculated accurately. The numerical experimental results validate the effectiveness and robustness of the proposed scheme.

Implementation of P2P Streaming System Based on Locality and Delay (지역성과 지연시간 기반의 P2P 스트리밍 시스템 구현)

  • An, Sun-hee;Park, Seung-chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.116-119
    • /
    • 2009
  • In this paper, a P2P streaming system for community TV service which requires realtime interactions was designed and implemented. The proposed system constructs a short delay tree-based P2P network in order to effectively support various community TV services within end-to-end delay bounds. Because a community service based on conversation requires a short delay. The P2P network of this paper was constructed by using an algorithm which utilizes locality and delay information. The implemented P2P streaming system is composed of a Web server and a application, each of which was implemented using Asp.Net and C#.Net respectively.

  • PDF

Digital mapping of soil carbon stock in Jeolla province using cubist model

  • Park, Seong-Jin;Lee, Chul-Woo;Kim, Seong-Heon;Oh, Taek-Keun
    • Korean Journal of Agricultural Science
    • /
    • v.47 no.4
    • /
    • pp.1097-1107
    • /
    • 2020
  • Assessment of soil carbon stock is essential for climate change mitigation and soil fertility. The digital soil mapping (DSM) is well known as a general technique to estimate the soil carbon stocks and upgrade previous soil maps. The aim of this study is to calculate the soil carbon stock in the top soil layer (0 to 30 cm) in Jeolla Province of South Korea using the DSM technique. To predict spatial carbon stock, we used Cubist, which a data-mining algorithm model base on tree regression. Soil samples (130 in total) were collected from three depths (0 to 10 cm, 10 to 20 cm, 20 to 30 cm) considering spatial distribution in Jeolla Province. These data were randomly divided into two sets for model calibration (70%) and validation (30%). The results showed that clay content, topographic wetness index (TWI), and digital elevation model (DEM) were the most important environmental covariate predictors of soil carbon stock. The predicted average soil carbon density was 3.88 kg·m-2. The R2 value representing the model's performance was 0.6, which was relatively high compared to a previous study. The total soil carbon stocks at a depth of 0 to 30 cm in Jeolla Province were estimated to be about 81 megatons.

Join Query Performance Optimization Based on Convergence Indexing Method (융합 인덱싱 방법에 의한 조인 쿼리 성능 최적화)

  • Zhao, Tianyi;Lee, Yong-Ju
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.1
    • /
    • pp.109-116
    • /
    • 2021
  • Since RDF (Resource Description Framework) triples are modeled as graph, we cannot directly adopt existing solutions in relational databases and XML technology. In order to store, index, and query Linked Data more efficiently, we propose a convergence indexing method combined R*-tree and K-dimensional trees. This method uses a hybrid storage system based on HDD (Hard Disk Drive) and SSD (Solid State Drive) devices, and a separated filter and refinement index structure to filter unnecessary data and further refine the immediate result. We perform performance comparisons based on three standard join retrieval algorithms. The experimental results demonstrate that our method has achieved remarkable performance compared to other existing methods such as Quad and Darq.

Estimation of various amounts of kaolinite on concrete alkali-silica reactions using different machine learning methods

  • Aflatoonian, Moein;Mirhosseini, Ramin Tabatabaei
    • Structural Engineering and Mechanics
    • /
    • v.83 no.1
    • /
    • pp.79-92
    • /
    • 2022
  • In this paper, the impact of a vernacular pozzolanic kaolinite mine on concrete alkali-silica reaction and strength has been evaluated. For making the samples, kaolinite powder with various levels has been used in the quality specification test of aggregates based on the ASTM C1260 standard in order to investigate the effect of kaolinite particles on reducing the reaction of the mortar bars. The compressive strength, X-Ray Diffraction (XRD) and Scanning Electron Microscope (SEM) experiments have been performed on concrete specimens. The obtained results show that addition of kaolinite powder to concrete will cause a pozzolanic reaction and decrease the permeability of concrete samples comparing to the reference concrete specimen. Further, various machine learning methods have been used to predict ASR-induced expansion per different amounts of kaolinite. In the process of modeling methods, optimal method is considered to have the lowest mean square error (MSE) simultaneous to having the highest correlation coefficient (R). Therefore, to evaluate the efficiency of the proposed model, the results of the support vector machine (SVM) method were compared with the decision tree method, regression analysis and neural network algorithm. The results of comparison of forecasting tools showed that support vector machines have outperformed the results of other methods. Therefore, the support vector machine method can be mentioned as an effective approach to predict ASR-induced expansion.