• Title/Summary/Keyword: Hierarchical Index

Search Result 259, Processing Time 0.02 seconds

GA based Fuzzy Modeling using Fuzzy Equalization and Linguistic Hedge (퍼지 균등화와 언어적인 Hedge를 이용한 GA 기반 퍼지 모델링)

  • 김승석;곽근창;유정웅;전명근
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2001.12a
    • /
    • pp.217-220
    • /
    • 2001
  • The fuzzy equalization method does not require the usual learning step for generating fuzzy rules. However it is heavily depend on the given input-output data set. So, we adapt an hierarchical scheme which sequentially optimizes the fuzzy inference system. Here, the parameters of fuzzy membership functions obtained from the fuzzy equalization are optimized by the genetic algorithm, and then they are also modified to increase the performance index using the linguistic hedge. Finally, we applied it to the Rice taste data and got better results than previous ones.

  • PDF

A Study on Criteria of Selecting Heavy Lifting Service Provider Using QFD/AHP (QFD/AHP를 이용한 Heavy Lifting 서비스 업체 선정을 위한 평가지표 개발에 대한 연구)

  • Park, Se-Jung;Kim, Seung-Hee;Kim, Woo-Je
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.3
    • /
    • pp.51-62
    • /
    • 2013
  • We propose a method using QFD for design the hierarchical structure of AHP. This method provides definition for each area of House of Quality and design the hierarchical structure of the bottom-up QFD/AHP in which the upper hierarchy is designed through the classification of common characteristics with a focus on the lower hierarchy. Finally, we apply it to the development of an evaluation index for selecting heavy lifting service providers. This study has significance as the first instance of designing the archical structure of AHP after objectively verifying whether MECE condition, the basic requirement for AHP design, is satisfied.

A Comparison of Data Extraction Techniques and an Implementation of Data Extraction Technique using Index DB -S Bank Case- (원천 시스템 환경을 고려한 데이터 추출 방식의 비교 및 Index DB를 이용한 추출 방식의 구현 -ㅅ 은행 사례를 중심으로-)

  • 김기운
    • Korean Management Science Review
    • /
    • v.20 no.2
    • /
    • pp.1-16
    • /
    • 2003
  • Previous research on data extraction and integration for data warehousing has concentrated mainly on the relational DBMS or partly on the object-oriented DBMS. Mostly, it describes issues related with the change data (deltas) capture and the incremental update by using the triggering technique of active database systems. But, little attention has been paid to data extraction approaches from other types of source systems like hierarchical DBMS, etc. and from source systems without triggering capability. This paper argues, from the practical point of view, that we need to consider not only the types of information sources and capabilities of ETT tools but also other factors of source systems such as operational characteristics (i.e., whether they support DBMS log, user log or no log, timestamp), and DBMS characteristics (i.e., whether they have the triggering capability or not, etc), in order to find out appropriate data extraction techniques that could be applied to different source systems. Having applied several different data extraction techniques (e.g., DBMS log, user log, triggering, timestamp-based extraction, file comparison) to S bank's source systems (e.g., IMS, DB2, ORACLE, and SAM file), we discovered that data extraction techniques available in a commercial ETT tool do not completely support data extraction from the DBMS log of IMS system. For such IMS systems, a new date extraction technique is proposed which first creates Index database and then updates the data warehouse using the Index database. We illustrates this technique using an example application.

Hierarchical Overlapping Clustering to Detect Complex Concepts (중복을 허용한 계층적 클러스터링에 의한 복합 개념 탐지 방법)

  • Hong, Su-Jeong;Choi, Joong-Min
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.1
    • /
    • pp.111-125
    • /
    • 2011
  • Clustering is a process of grouping similar or relevant documents into a cluster and assigning a meaningful concept to the cluster. By this process, clustering facilitates fast and correct search for the relevant documents by narrowing down the range of searching only to the collection of documents belonging to related clusters. For effective clustering, techniques are required for identifying similar documents and grouping them into a cluster, and discovering a concept that is most relevant to the cluster. One of the problems often appearing in this context is the detection of a complex concept that overlaps with several simple concepts at the same hierarchical level. Previous clustering methods were unable to identify and represent a complex concept that belongs to several different clusters at the same level in the concept hierarchy, and also could not validate the semantic hierarchical relationship between a complex concept and each of simple concepts. In order to solve these problems, this paper proposes a new clustering method that identifies and represents complex concepts efficiently. We developed the Hierarchical Overlapping Clustering (HOC) algorithm that modified the traditional Agglomerative Hierarchical Clustering algorithm to allow overlapped clusters at the same level in the concept hierarchy. The HOC algorithm represents the clustering result not by a tree but by a lattice to detect complex concepts. We developed a system that employs the HOC algorithm to carry out the goal of complex concept detection. This system operates in three phases; 1) the preprocessing of documents, 2) the clustering using the HOC algorithm, and 3) the validation of semantic hierarchical relationships among the concepts in the lattice obtained as a result of clustering. The preprocessing phase represents the documents as x-y coordinate values in a 2-dimensional space by considering the weights of terms appearing in the documents. First, it goes through some refinement process by applying stopwords removal and stemming to extract index terms. Then, each index term is assigned a TF-IDF weight value and the x-y coordinate value for each document is determined by combining the TF-IDF values of the terms in it. The clustering phase uses the HOC algorithm in which the similarity between the documents is calculated by applying the Euclidean distance method. Initially, a cluster is generated for each document by grouping those documents that are closest to it. Then, the distance between any two clusters is measured, grouping the closest clusters as a new cluster. This process is repeated until the root cluster is generated. In the validation phase, the feature selection method is applied to validate the appropriateness of the cluster concepts built by the HOC algorithm to see if they have meaningful hierarchical relationships. Feature selection is a method of extracting key features from a document by identifying and assigning weight values to important and representative terms in the document. In order to correctly select key features, a method is needed to determine how each term contributes to the class of the document. Among several methods achieving this goal, this paper adopted the $x^2$�� statistics, which measures the dependency degree of a term t to a class c, and represents the relationship between t and c by a numerical value. To demonstrate the effectiveness of the HOC algorithm, a series of performance evaluation is carried out by using a well-known Reuter-21578 news collection. The result of performance evaluation showed that the HOC algorithm greatly contributes to detecting and producing complex concepts by generating the concept hierarchy in a lattice structure.

An Indexing Technique for Object-Oriented Geographical Databases (객체지향 지리정보 데이터베이스를 위한 색인기법)

  • Bu, Ki-Dong
    • Journal of the Korean association of regional geographers
    • /
    • v.3 no.2
    • /
    • pp.105-120
    • /
    • 1997
  • One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.

  • PDF

Influencing factors on happiness index in clinical dental hygienists (임상치과위생사의 행복지수에 영향을 미치는 요인)

  • Min, Hee-Hong
    • Journal of Korean society of Dental Hygiene
    • /
    • v.15 no.1
    • /
    • pp.1-9
    • /
    • 2015
  • Objectives: The purpose of this study is to investigate the use of happiness index in dental hygienists. This study can be used to improve the quality of life and the turnover intention in the dental hygienists. Methods: The subjects were 281 dental hygienists in Seoul, Gyeonggi-do, and Chungcheong province. A self-reported questionnaire was completed by the subjects. The questionnaire consisted of 7 questions of general characteristics of the subjects, 7 questions of dental hygiene performance, and 9 questions of happiness index. The instrument for happiness index was modified from Suh and Koo. Cronbach's alpha was 0.850 in the happiness index measure by Likert 7 scale. The instrument for professionalism was modified from Baek and consisted of 25 questions measure by Likert 5 scale. Cronbach's alpha was 0.694 in the professionalism. The instrument for turnover intention was modified from Lee and consisted of 5 questions measured by Likert 5 scale. Cronbach's alpha was 0.712 in turnover intention. Data were analyzed using SPSS 18.0. for one way ANOVA, Duncan posthoc test, Pearson correlation coefficients and hierarchical regression. Results: The means of happiness index, professionalism and turnover intention of subjects were 4.44, 3.06 and 3.05, respectively. The happiness index was higher in those who are married(4.66), those who have high income, and those who have careers in dental hygienists(4.61). There were significant differences in the happiness index by the average daily working hours, place of treatment, work intensity and off duty hours. Conclusions: This study suggests that improvement of the happiness index in clinical dental hygienists requires the continuing and systematic education program and administrative support that can reduce the turnover intention.

Satellite Imagery based Winter Crop Classification Mapping using Hierarchica Classification (계층분류 기법을 이용한 위성영상 기반의 동계작물 구분도 작성)

  • Na, Sang-il;Park, Chan-won;So, Kyu-ho;Park, Jae-moon;Lee, Kyung-do
    • Korean Journal of Remote Sensing
    • /
    • v.33 no.5_2
    • /
    • pp.677-687
    • /
    • 2017
  • In this paper, we propose the use of hierarchical classification for winter crop mapping based on satellite imagery. A hierarchical classification is a classifier that maps input data into defined subsumptive output categories. This classification method can reduce mixed pixel effects and improve classification performance. The methodology are illustrated focus on winter cropsin Gimje city, Jeonbuk with Landsat-8 imagery. First, agriculture fields were extracted from Landsat-8 imagery using Smart Farm Map. And then winter crop fields were extracted from agriculture fields using temporal Normalized Difference Vegetation Index (NDVI). Finally, winter crop fields were then classified into wheat, barley, IRG, whole crop barley and mixed crop fields using signature from Unmanned Aerial Vehicle (UAV). The results indicate that hierarchical classifier could effectively identify winter crop fields with an overall classification accuracy of 98.99%. Thus, it is expected that the proposed classification method would be effectively used for crop mapping.

SRN Hierarchical Modeling for Packet Retransmission and Channel Allocation in Wireless Networks (무선망에서 패킷 재전송과 채널할당 성능분석을 위한 SRN 계층 모델링)

  • 노철우
    • The KIPS Transactions:PartC
    • /
    • v.8C no.1
    • /
    • pp.97-104
    • /
    • 2001
  • In this paper, we present a new hierarchical model for performance analysis of channel allocation and packet service protocol in wireless n network. The proposed hierarchical model consists of two parts : upper and lower layer models. The upper layer model is the structure state model representing the state of the channel allocation and call service. The lower layer model, which captures the performance of the system within a given structure state, is the wireless packet retransmission protocol model. These models are developed using SRN which is an modeling tool. SRN, an extension of stochastic Petri net, provides compact modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. Fixed point iteration is used to determine the model parameters that are not available directly as input. That is, the call service time of the upper model can be obtained by packet delay in the lower model, and the packet generation rates of the lower model come from call generation rates of the upper model.

  • PDF

Using Multilevel Model for Evaluation on Community Support Program (다층모형을 활용한 상수원 관리지역 주민지원사업 평가에 관한 연구)

  • Kim, Dong Hyun;Jung, Juchul
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.3D
    • /
    • pp.469-476
    • /
    • 2011
  • The purposes of research is to understand the need of and the effectiveness of multilevel model to evaluate community support program in watershed areas. If the properties of policy target have hierarchical characteristics, the multilevel analysis is an adequate method to evaluate and test the effectiveness of policy. Also, the technique of multilevel modeling is extended to testing the relevance between performance appraisal and policy effectiveness. The case study of watershed region's community support program was estimated using satisfaction and economic aid level of policy target. This research has three results. First, the multilevel analysis should be used in nested data structure to estimate the effect of policy intervention. Second, the indexes of multilevel modeling should be used complementally to that of the traditional index approach. Third, the spatial hierarchical structure should be considered as the hierarchical structure in policy evaluation.

Spatial distribution and uncertainty of daily rainfall for return level using hierarchical Bayesian modeling combined with climate and geographical information (기후정보와 지리정보를 결합한 계층적 베이지안 모델링을 이용한 재현기간별 일 강우량의 공간 분포 및 불확실성)

  • Lee, Jeonghoon;Lee, Okjeong;Seo, Jiyu;Kim, Sangdan
    • Journal of Korea Water Resources Association
    • /
    • v.54 no.10
    • /
    • pp.747-757
    • /
    • 2021
  • Quantification of extreme rainfall is very important in establishing a flood protection plan, and a general measure of extreme rainfall is expressed as an T-year return level. In this study, a method was proposed for quantifying spatial distribution and uncertainty of daily rainfall depths with various return periods using a hierarchical Bayesian model combined with climate and geographical information, and was applied to the Seoul-Incheon-Gyeonggi region. The annual maximum daily rainfall depth of six automated synoptic observing system weather stations of the Korea Meteorological Administration in the study area was fitted to the generalized extreme value distribution. The applicability and reliability of the proposed method were investigated by comparing daily rainfall quantiles for various return levels derived from the at-site frequency analysis and the regional frequency analysis based on the index flood method. The uncertainty of the regional frequency analysis based on the index flood method was found to be the greatest at all stations and all return levels, and it was confirmed that the reliability of the regional frequency analysis based on the hierarchical Bayesian model was the highest. The proposed method can be used to generate the rainfall quantile maps for various return levels in the Seoul-Incheon-Gyeonggi region and other regions with similar spatial sizes.