• Title/Summary/Keyword: Space Partition

Search Result 235, Processing Time 0.032 seconds

Design of Optimized Pattern Recognizer by Means of Fuzzy Neural Networks Based on Individual Input Space (개별 입력 공간 기반 퍼지 뉴럴 네트워크에 의한 최적화된 패턴 인식기 설계)

  • Park, Keon-Jun;Kim, Yong-Kab;Kim, Byun-Gon;Hoang, Geun-Chang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.181-189
    • /
    • 2013
  • In this paper, we introduce the fuzzy neural network based on the individual input space to design the pattern recognizer. The proposed networks configure the network by individually dividing each input space. The premise part of the networks is independently composed of the fuzzy partition of individual input spaces and the consequence part of the networks is represented by polynomial functions. The learning of fuzzy neural networks is realized by adjusting connection weights of the neurons in the consequent part of the fuzzy rules and it follows a back-propagation algorithm. In addition, in order to optimize the parameters of the proposed network, we use real-coded genetic algorithms. Finally, we design the optimized pattern recognizer using the experimental data for pattern recognition.

DUAL PRESENTATION AND LINEAR BASIS OF THE TEMPERLEY-LIEB ALGEBRAS

  • Lee, Eon-Kyung;Lee, Sang-Jin
    • Journal of the Korean Mathematical Society
    • /
    • v.47 no.3
    • /
    • pp.445-454
    • /
    • 2010
  • The braid group $B_n$ maps homomorphically into the Temperley-Lieb algebra $TL_n$. It was shown by Zinno that the homomorphic images of simple elements arising from the dual presentation of the braid group $B_n$ form a basis for the vector space underlying the Temperley-Lieb algebra $TL_n$. In this paper, we establish that there is a dual presentation of Temperley-Lieb algebras that corresponds to the dual presentation of braid groups, and then give a simple geometric proof for Zinno's theorem, using the interpretation of simple elements as non-crossing partitions.

A Fuzzy Decision Tree to Partition Feature Space with Oblique Planes (특징 공간을 사선 분할하는 퍼지 결정 트리)

  • 이우항;이건명
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.21-23
    • /
    • 1999
  • 결정 트리는 실세계에서 얻어지는 많은 사례들로부터 분류 정보를 얻기 위해 사용되는 유용한 방법중의 하나이다. 분류를 목적으로 사용되는 사례, 즉 데이터들은 실제 현장에서 얻어지기 때문에 관측오류, 불확실성, 주관적인 판단 등의 원인으로 참 값이 아닌 근사 값으로써 기술되는 경우가 많으며, 이러한 잠재적 오류로 인해 잘못된 결정 트리가 생성될 수 있다. 한편, 트리를 생성하는 각각의 과정에서 하나의 특징 값만을 고려하지 않고 두 가지 이상의 특징 값을 동시에 고려하여 결정 트리를 생성할 경우 보다 정확한 분류 정보를 기대할 수 있다. 본 논문에서는 수치 특징 값으로 기술된 데이터로부터 보다 정확한 분류 정보를 얻을 수 있고, 작은 오류에 강건한 사선형 분할 퍼지 결정 트리를 제안한다. 또한 제안된 사선형 분할 퍼지 결정 트리의 생성 절차 및 생성된 결정 트리를 이용하여 새로운 데이터에 분류 정보를 부여하는 추론 과정을 소개한다.

  • PDF

An Efficient Algorithm for Mining Frequent Sequences In Spatiotemporal Data

  • Vhan Vu Thi Hong;Chi Cheong-Hee;Ryu Keun-Ho
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2005.11a
    • /
    • pp.61-66
    • /
    • 2005
  • Spatiotemporal data mining represents the confluence of several fields including spatiotemporal databases, machine loaming, statistics, geographic visualization, and information theory. Exploration of spatial data mining and temporal data mining has received much attention independently in knowledge discovery in databases and data mining research community. In this paper, we introduce an algorithm Max_MOP for discovering moving sequences in mobile environment. Max_MOP mines only maximal frequent moving patterns. We exploit the characteristic of the problem domain, which is the spatiotemporal proximity between activities, to partition the spatiotemporal space. The task of finding moving sequences is to consider all temporally ordered combination of associations, which requires an intensive computation. However, exploiting the spatiotemporal proximity characteristic makes this task more cornputationally feasible. Our proposed technique is applicable to location-based services such as traffic service, tourist service, and location-aware advertising service.

  • PDF

Development of Deck System for Two-Girder Bridges (합리화 2주형교용 바닥판의 개발을 위한 실험 연구)

  • 주봉철;김병석;김영진;박성용;이정우;신호상
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2001.05a
    • /
    • pp.113-118
    • /
    • 2001
  • The two-girder composite bridge has the girder space of more than 5m, for special case, over than 15m. Therefor, the design and construction of this bridge system require new approaches. To ensure the structural safety, the deck depth should be increased. Therefore, the economically designed deck system is necessary for th two-girder bridge. This study is the first step to develop the deck system for two-girder bridges. In this study, a literatute survey is performed to develop a new deck system for two-girder type of bridges. By considering the characteristics of two-girder bridge system, a cast-in-place PSC deck is proposed for the two-girder bridges. To examine structural behavior and safety of the proposed PSC deck, three real scale partition deck(3m$\times$5m) are tested under the static loading. In the test, the failure mode and behavior of each specimen, and ultimate load carrying capacity of the two-girder-bridge deck are identified.

  • PDF

An Efficient Learning Rule of Simple PR systems

  • Alan M. N. Fu;Hong Yan;Lim, Gi Y .
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.731-739
    • /
    • 1998
  • The probabilistic relaxation(PR) scheme based on the conditional probability and probability space partition has the important property that when its compatibility coefficient matrix (CCM) has uniform components it can classify m-dimensional probabilistic distribution vectors into different classes. When consistency or inconsistency measures have been defined, the properties of PRs are completely determined by the compatibility coefficients among labels of labeled objects and influence weight among labeled objects. In this paper we study the properties of PR in which both compatibility coefficients and influence weights are uniform, and then a learning rule for such PR system is derived. Experiments have been performed to verify the effectiveness of the learning rule.

  • PDF

On Flexible Bayesian Test Criteria for Nested Point Null Hypotheses of Multiple Regression Coefficients

  • Jae-Hyun Kim;Hea-Jung Kim
    • Communications for Statistical Applications and Methods
    • /
    • v.3 no.3
    • /
    • pp.205-214
    • /
    • 1996
  • As flexible Bayesian test criteria for nested point null hypotheses of multiple regression coefficients, partial and overall Bayes factors are introduced under a class of intuitively meaningful prior. The criteria lead to a simple method for considering different prior beliefs on the subspaces that constitute a partition of the coefficient parameter space. A couple of tests are suggested based on the criteria. It is shown that they enable us to obtain pairwise comparisons of hypotheses of the partitioned subspaces. Through a Monte Carlo simulation, performance of the tests based on the criteria are compared with the usual Bayesian test (based on Bayes factor)in terms of their respective powers.

  • PDF

A Study on the Improvement of the Evacuation in Ward of the General Hospital (종합병원 병동부 피난환경 개선에 관한 연구)

  • Kim, Woo-Seok;Chai, Choul-Gyun
    • Korean Institute of Interior Design Journal
    • /
    • v.15 no.5 s.58
    • /
    • pp.202-208
    • /
    • 2006
  • The purpose of this study is to suggest architectural planning guideline for the improvement of the evacuation environment in a ward. To suggest of guideline, the problem of irrational domestic criteria is searched according to compare National fire code (NFPA101, Life safety code) with Korea building law. This study includes stairs, corridors and exit door etc. but excludes fire facilities. To verify effectiveness of suggested guideline, egress simulation is run that based on databases according to literature survey. The results of this study could be summarized as follow: Suggested guidelines are subdivision(fire partition), evacuation by elevator, secure useful waiting space of elevator hall and smokeproof enclosures, the corridor is divided by fire or smoke barriers corridor from hazardous room, only wheeled items are arranged in corridors of a ward story. The result of computer simulation for suggested guidelines verify that egress time can be decreased 20% or above.

Interior Planning for Classrooms in Kindergarten (유치원 보육실 실내환경계획 방향에 관한연구)

  • 황연숙;박희진
    • Korean Institute of Interior Design Journal
    • /
    • no.15
    • /
    • pp.62-68
    • /
    • 1998
  • Children develop in direct relation and response to their physical environment, The purposes of this study were to investigate the current interior design conditions of classrooms in kindergarten and to provide interior planning guidelines for children's behavioral and developmental improvement and better educational environment. Data were collected through interview and questionnaire survey. The sample included 239 teachers who were employed in 23 kindergartens located in Pusan. The data were analyzed by using SPSS-PC. The major findings were as follows; (1) Wood and wallpapers which provide various colors and patterns are recommendable as a classroom finish rather than paint which looks monotonous. (2) Teachers preferred 7 or 8 activity centers in classroom and furniture or partition is the best when dividing space. (3) Classroom should be large enough to locate various types of furniture that designed based on child-size and objects to store. (4) Activity centers should be lit by different types of task lighting such as floor lamp and backer to provide sufficient level of light.

  • PDF

Sequential Paging under Delay Bound for Next Generation Mobile Systems (차세대 이동통신에서의 지연을 고려한 순차적 페이징)

  • Lee, Chae-Yong;Ku, Sang-Hoon
    • Korean Management Science Review
    • /
    • v.23 no.3
    • /
    • pp.13-25
    • /
    • 2006
  • To reduce the signaling tost of paging in mobile communication, sequential paging schemes are proposed by partitioning a location area into several paging areas such that each area is paged sequentially. Necessary conditions for the optimal partition of cells with delay bound are examined by considering the mobiles location probability at each cell. The Optimal Cell Partitioning (OCP) is proposed based on the necessary conditions and the fathoming rule which trims off the unnecessary solution space and expedite the search process. Two Heuristics, BSG and BNC are also presented to further increase the computational efficiency in real-world paging scheme for the next generation mobile systems. The effectiveness of the 1)reposed paging schemes is illustrated with computational results. The Heuristic BSG that performs the search in the most promising solution group outperforms the best existing procedure with the 6-69% gain in paging cost in problems with 100 cells.