• Title/Summary/Keyword: Search Space Reduction

Search Result 75, Processing Time 0.029 seconds

Distribution Feeder Reconfiguration Using Heuristic Rules (경험적 규칙을 이용한 배전계통의 재구성기법)

  • Cho, Si-Hyung;Choi, Byoung-Youn;Woo, Kwang-Bang
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.363-365
    • /
    • 1991
  • This paper presents a method for feeder reconfiguration in order to operate distribution systems efficiently using heuristic rules. The reconfiguration method presented here not only eliminates various abnormal states but also achieves minimum power loss and optimum load balance of the distribution feeders under normal operating condition transfering loads from one feeder to anoter applying the experiences of the experts. To implement the method effectively, a best-first tree searching strategy based on heuristics is used to evaluate the various load transfer alternatives. The development of a rule-based system aimed at the reduction of the search space is presented as a means of implementing the best-first searching strategy. The results of the computer simulation of the above procedure are as follows; 1) achieving minimum power loss of the distribution feeder adopting the optimum load transfer alternative. 2) Enhencing system reliability and achieving load balance through rational allocation of the feeder loads.

  • PDF

CHAID Algorithm by Cube-based Proportional Sampling

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2004.04a
    • /
    • pp.39-50
    • /
    • 2004
  • The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID(Chi-square Automatic Interaction Detector) uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

  • PDF

CHAID Algorithm by Cube-based Proportional Sampling

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.4
    • /
    • pp.803-816
    • /
    • 2004
  • The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

  • PDF

A Study on the Restoration Aid Expert System for Distribution Networks (배전계통의 복구 지원 전문가 시스템에 관한 연구)

  • Lee, H.J.;Lee, K.S.;Lee, C.K.
    • Proceedings of the KIEE Conference
    • /
    • 2001.07a
    • /
    • pp.3-5
    • /
    • 2001
  • When a fault occurs on distribution network. blackout region may happen, then it should be restored as fast as possible to minimize interruption of electric service. In this paper. A near optimal method to restore distribution network is proposed. For an optimal restoration, the number or switching operations must be minimized. The proposed method generates a general restoration plan for any distribution network fault and designed to reduce switching operations considering available load transfers. In this method overall process time can reduce with heuristic rules, which make a reduction of search space before restoration process. To achieve a near optimal solution, multiple load transfer algorithm is proposed too.

  • PDF

An Efficient Low Complexity Blind Equalization Using Micro-Genetic Algorithm

  • Kim, Sung-Soo;Kang, Jee-Hye
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.3
    • /
    • pp.283-287
    • /
    • 2004
  • In this paper, a method of designing the efficient batch blind equalization with low complexity using a micro genetic algorithm (GA), is presented. In general, the blind equalization techniques that are focused on the complexity reduction might be carried out with minor effect on the performance. Among the advanced various subjects in the field of GAs, a micro genetic algorithm is employed to identity the unknown channel impulse response in order to reduce the search space effectively. A new cost function with respect to the constant modulus criterion is suggested considering its relation to the Wiener criterion. We provide simulation results to show the superiority of the proposed techniques compared to other existing techniques.

The Optimal Distribution Feeder Reconfiguration Using Knowledge Base (지식베이스를 이용한 배전계통의 최적재구성)

  • Cho, S.H.;Choi, B.Y.;Kim, S.H.;Lee, J.K.
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.99-101
    • /
    • 1993
  • This paper presents an approach to feeder reconfiguration in order to achieve an efficient operation of distribution systems utilizing knowledge base. The optimal feeder reconfiguration in this study eliminates various abnormal states which will create feeder overloads and feeder constraint problems. and will also accomplish minimum power loss of the distribution systems under normal operating condition by means of branch exchanges to change the status of sectionalizing switches with experiences of the experts. For an effective implementation of feeder reconfiguration, a best-first tree searching strategy based on heuristics is employed to evaluate the various alternatives of load transfer. The heuristic exchange of branches results in reduction of the search space as a means of implementing the best-first searching strategy.

  • PDF

Construction of moving object tracking framework with fuzzy clustering, prediction and Hausdorff distance (퍼지 군집, 예측과 하우스돌프 거리를 이용한 이동물체 추적 프레임워크 구축)

  • 소영성
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.2
    • /
    • pp.128-133
    • /
    • 1998
  • In this paper, we present a parallel framework for tracking moving objects. Parallel framework consists largely of two parts:Search Space Reduction(SSR) and Tracking(TR). SSR is further composed of fuzzy clustering and prediction based on Kalman filter. TR is done by boundarymatching using the Hausdorff distance based on distance transform.

  • PDF

A study on certification criteria for effective application of green building rating system water resource (친환경건축물 인증제도 수자원 항목의 효과적 적용을 위한 평가방법 연구)

  • Kim, Hye-Jin;Kim, Kong-Suk;Kim, Byung-Seon
    • Proceedings of the SAREK Conference
    • /
    • 2006.06a
    • /
    • pp.1049-1054
    • /
    • 2006
  • In many countries, methods to evaluate buildings have been investigated and practiced in order to reduce energy use and search for sustainable architecture while providing comfortable space for the users, in Korea, the current certification system has a short history, and has been improved for better practicability. Among many different factors in the certification system, the water resource problem is an important as the demand has been sharply increasing while reckless use and sewage treatment system causes the reduction of usable water. This study aims to find problems of water usage in building. water resource in the current certification will be used for the analysis of each factor in water resource, and the direction of improvement required in the certification in order to improve the water usage in buildigns will be proposed.

  • PDF

User Interaction-based Graph Query Formulation and Processing (사용자 상호작용에 기반한 그래프질의 생성 및 처리)

  • Jung, Sung-Jae;Kim, Taehong;Lee, Seungwoo;Lee, Hwasik;Jung, Hanmin
    • Journal of KIISE:Databases
    • /
    • v.41 no.4
    • /
    • pp.242-248
    • /
    • 2014
  • With the rapidly growing amount of information represented in RDF format, efficient querying of RDF graph has become a fundamental challenge. SPARQL is one of the most widely used query languages for retrieving information from RDF dataset. SPARQL is not only simple in its syntax but also powerful in representation of graph pattern queries. However, users need to make a lot of efforts to understand the ontology schema of a dataset in order to compose a relevant SPARQL query. In this paper, we propose a graph query formulation and processing scheme based on ontology schema information which can be obtained by summarizing RDF graph. In the context of the proposed querying scheme, a user can interactively formulate the graph queries on the graphic user interface without making efforts to understand the ontology schema and even without learning SPARQL syntax. The graph query formulated by a user is transformed into a set of class paths, which are stored in a relational database and used as the constraint for search space reduction when the relational database executes the graph search operation. By executing the LUBM query 2, 8, and 9 over LUBM (10,0), it is shown that the proposed querying scheme returns the complete result set.

News Video Shot Boundary Detection using Singular Value Decomposition and Incremental Clustering (특이값 분해와 점증적 클러스터링을 이용한 뉴스 비디오 샷 경계 탐지)

  • Lee, Han-Sung;Im, Young-Hee;Park, Dai-Hee;Lee, Seong-Whan
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.2
    • /
    • pp.169-177
    • /
    • 2009
  • In this paper, we propose a new shot boundary detection method which is optimized for news video story parsing. This new news shot boundary detection method was designed to satisfy all the following requirements: 1) minimizing the incorrect data in data set for anchor shot detection by improving the recall ratio 2) detecting abrupt cuts and gradual transitions with one single algorithm so as to divide news video into shots with one scan of data set; 3) classifying shots into static or dynamic, therefore, reducing the search space for the subsequent stage of anchor shot detection. The proposed method, based on singular value decomposition with incremental clustering and mercer kernel, has additional desirable features. Applying singular value decomposition, the noise or trivial variations in the video sequence are removed. Therefore, the separability is improved. Mercer kernel improves the possibility of detection of shots which is not separable in input space by mapping data to high dimensional feature space. The experimental results illustrated the superiority of the proposed method with respect to recall criteria and search space reduction for anchor shot detection.