• Title/Summary/Keyword: Splitting Rule

Search Result 41, Processing Time 0.023 seconds

An Algorithm Solving SAT Problem Based on Splitting Rule and Extension Rule

  • Xu, Youjun
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1149-1157
    • /
    • 2017
  • The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve the efficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (Improved Extension Rule) is based on extension rule. The number of atoms and the number of clauses affect the efficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithm CIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLL rules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause set is got from these small clause sets'. A strategy MOAMD (maximum occurrences and maximum difference) for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. This arrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, the algorithm CIER will be more efficient.

Splitting Algorithm Using Total Information Gain for a Market Segmentation Problem

  • Kim, Jae-Kyeong;Kim, Chang-Kwon;Kim, Soung-Hie
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.2
    • /
    • pp.183-203
    • /
    • 1993
  • One of the most difficult and time-consuming stages in the development of the knowledge-based system is a knowledge acquisition. A splitting algorithm is developed to infer a rule-tree which can be converted to a rule-typed knowledge. A market segmentation may be performed in order to establish market strategy suitable to each market segment. As the sales data of a product market is probabilistic and noisy, it becomes necessary to prune the rule-tree-at an acceptable level while generating a rule-tree. A splitting algorithm is developed using the pruning measure based on a total amount of information gain and the measure of existing algorithms. A user can easily adjust the size of the resulting rule-tree according to his(her) preferences and problem domains. The algorithm is applied to a market segmentation problem of a medium-large computer market. The algorithm is illustrated step by step with a sales data of a computer market and is analyzed.

  • PDF

Splitting Algorithms and Recovery Rules for Zero Anaphora Resolution in Korean Complex Sentences (한국어 복합문에서의 제로 대용어 처리를 위한 분해 알고리즘과 복원규칙)

  • Kim, Mi-Jin;Park, Mi-Sung;Koo, Sang-Ok;Kang, Bo-Yeong;Lee, Sang-Jo
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.10
    • /
    • pp.736-746
    • /
    • 2002
  • Zero anaphora occurs frequently in Korean complex sentences, and it makes the interpretation of sentences difficult. This paper proposes splitting algorithms and zero anaphora recovery rules for the purpose of handling zero anaphora, and also presents a resolution methodology. The paper covers quotations, conjunctive sentences and embedded sentences out of the complex sentences shown in the newspaper articles, with an exclusion of embedded sentences of auxiliary verb. We manage the quotations using the equivalent noun phrase deletion rule according to subject person constraint, the nominalized embedded sentences using the equivalent noun phrase deletion rule, the adnominal embedded sentences using the relative noun phrase deletion rule and the conjunctive sentences using the conjunction reduction rule in reverse. The classified table of the endings which relate to a formation of the complex sentences is used for splitting the complex sentences, and the syntactic rules, applied when being omitted, are used in reverse for recovering zero anaphora. The presented rule showed the result of 83.53% in perfect resolution and 11.52% in partial resolution.

A Corpus-based Hybrid Translation System for Limited Domain (제한된 도메인을 위한 코퍼스 기반의 하이브리드 번역 시스템)

  • Kang, Un-Gu;Kim, Sung-Hyun;Lee, Byung-Mun;Lee, Young-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.11
    • /
    • pp.826-836
    • /
    • 2010
  • This paper proposes a hybrid machine translation system which integrates SMT, RBMT, and PBMT in serial manner. SMT in our project has been implemented as a Quasi-syntax-based system where monotone search is done, given a preprocessed string of foreign language. Preprocessing includes rule-based reordering, NE recognition, clausal splitting, and attaching pattern translation information at the end of the input text. For lengthy & complex sentences, clausal splitting turned out to generate better translation than normal input.

Malaysian Name-based Ethnicity Classification using LSTM

  • Hur, Youngbum
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.12
    • /
    • pp.3855-3867
    • /
    • 2022
  • Name separation (splitting full names into surnames and given names) is not a tedious task in a multiethnic country because the procedure for splitting surnames and given names is ethnicity-specific. Malaysia has multiple main ethnic groups; therefore, separating Malaysian full names into surnames and given names proves a challenge. In this study, we develop a two-phase framework for Malaysian name separation using deep learning. In the initial phase, we predict the ethnicity of full names. We propose a recurrent neural network with long short-term memory network-based model with character embeddings for prediction. Based on the predicted ethnicity, we use a rule-based algorithm for splitting full names into surnames and given names in the second phase. We evaluate the performance of the proposed model against various machine learning models and demonstrate that it outperforms them by an average of 9%. Moreover, transfer learning and fine-tuning of the proposed model with an additional dataset results in an improvement of up to 7% on average.

Interpretability Comparison of Popular Decision Tree Algorithms (대표적인 의사결정나무 알고리즘의 해석력 비교)

  • Hong, Jung-Sik;Hwang, Geun-Seong
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.2
    • /
    • pp.15-23
    • /
    • 2021
  • Most of the open-source decision tree algorithms are based on three splitting criteria (Entropy, Gini Index, and Gain Ratio). Therefore, the advantages and disadvantages of these three popular algorithms need to be studied more thoroughly. Comparisons of the three algorithms were mainly performed with respect to the predictive performance. In this work, we conducted a comparative experiment on the splitting criteria of three decision trees, focusing on their interpretability. Depth, homogeneity, coverage, lift, and stability were used as indicators for measuring interpretability. To measure the stability of decision trees, we present a measure of the stability of the root node and the stability of the dominating rules based on a measure of the similarity of trees. Based on 10 data collected from UCI and Kaggle, we compare the interpretability of DT (Decision Tree) algorithms based on three splitting criteria. The results show that the GR (Gain Ratio) branch-based DT algorithm performs well in terms of lift and homogeneity, while the GINI (Gini Index) and ENT (Entropy) branch-based DT algorithms performs well in terms of coverage. With respect to stability, considering both the similarity of the dominating rule or the similarity of the root node, the DT algorithm according to the ENT splitting criterion shows the best results.

Structural Relaxation of Semiconducting Vanadate and IR-Transmitting Gallate Glasses Containing Iron

  • Nishida, Tetsuaki
    • The Korean Journal of Ceramics
    • /
    • v.6 no.1
    • /
    • pp.9-14
    • /
    • 2000
  • Glass transition temperature (T/sub g/) is proportional to the quadrupole splitting(Δ) of Fe(III) obtained from the /sup 57/Fe Mossbauer spectra (T/sub g/-Δ rule (1990)). The values of Δ reflect the distortion of Fe(III) atoms, which occupy the sites of network-forming atoms. Heat treatment of potassium vanadate and calcium gallate glasses at around the individual T/sub g/ causes a structural relaxation, accompanying a linear decrease of T/sub g/ and Δ values. These experimental results prove that T/sub g/ decreases with a decrease in the distortion of VO₄, GaO₄, and FeO₄tetrahedra, as the T/sub g/-Δ rule predicted.

  • PDF

Growth and Characterization of $ZnGa_2Se_4$ Single Crystal Thin Films by Hot Wall Epitaxy (Hot Wall Epitaxy(HWE)에 의한 $ZnGa_2Se_4$단결정 박막 성장과 특성에 관한 연구)

  • 장차익;홍광준;정준우;백형원;정경아;방진주;박창선
    • Korean Journal of Crystallography
    • /
    • v.12 no.3
    • /
    • pp.127-136
    • /
    • 2001
  • A stoichiometric mixture of evaporating materials for ZnGa₂Se₄single crystal thin films was prepared from horizontal furnace. To obtain the single crystal thin films, ZnGa₂Se₄mixed crystal was deposited on thoroughly etched semi-insulating GaAs(100) substrate by the Hot Wall Epitaxy (HWE) system. The source and substrate temperatures were 610℃ and 450℃, respectively. The crystalline structure of the single crystal thin films was investigated by the photoluminescence and double crystal X-ray diffraction (DCXD). The carrier density and mobility of ZnGa₂Se₄single crystal thin films measured from Hall effect by von der Pauw method are 9.63×10/sup 17/㎤ and 296 ㎠/V·s at 293 K, respectively. From the photocurrent spectrum by illumination of perpendicular light on the c-axis of the ZnGa₂Se₄single crystal thin film, we have found that the values of spin orbit splitting △so and the crystal field splitting Δcr were 251.9meV and 183.2 meV at 10 K, respectively. From the photoluminescence measurement on th ZnGa₂Se₄single crystal thin film, we observed free excition (Ex) existing only high quality crystal and neutral bound exiciton (A°, X) having very strong peak intensity. Then, the full-width-at-half-maximum (FWHM) and binding energy of neutral acceptor bound excition were 11 meV and 24.4 meV, respectivity. By Haynes rule, an activation energy of impurity was 122 meV.

  • PDF

Growth and Characterization of $CdGa_2Se_4$ Single Crystal Thin Films by Hot Wall Epitaxy (Hot Wall Epitaxy (HWE)에 의한 $CdGa_2Se_4$ 단결정 박막 성장과 특성)

  • Choi, S.P.;Hong, K.J.
    • Journal of Sensor Science and Technology
    • /
    • v.10 no.6
    • /
    • pp.328-337
    • /
    • 2001
  • The stochiometric mix of evaporating materials for the $CdGa_2Se_4$ single crystal thin films was prepared from horizontal furnace. To obtain the single crystal thin films, $CdGa_2Se_4$ mixed crystal was deposited on thoroughly etched semi-insulating GaAs(100) substrate by the Hot Wall Epitaxy (HWE) system. The source and substrate temperature were $630^{\circ}C$ and $420^{\circ}C$, respectively. The crystalline structure of single crystal thin films was investigated by the photoluminescence and double crystal X-ray diffraction (DCXD). The carrier density and mobility of $CdGa_2Se_4$ single crystal thin films measured from Hall effect by van der Pauw method are $8.27{\times}10^{17}cm^{-3}$, $345\;cm^2/V{\cdot}s$ at 293 K, respectively. From the photocurrent spectrum by illumination of perpendicular light on the c-axis of the $CuInSe_2$ single crystal thin film, we have found that the values of spin orbit splitting ${\Delta}So$ and the crystal field splitting ${\Delta}Cr$ were 106.5 meV and 418.9 meV at 10 K, respectively. From the photoluminescence measurement on $CdGa_2Se_4$ single crystal thin film, we observed free excition ($E_x$) existing only high quality crystal and neutral bound exiciton ($D^{\circ}$, X) having very strong peak intensity. Then, the full-width-at -half-maximum(FWHM) and binding energy of neutral donor bound excition were 8 meV and 13.7 meV, respectivity. By Haynes rule, an activation energy of impurity was 137 meV.

  • PDF

Tree-structured Clustering for Continuous Data (연속형 자료에 대한 나무형 군집화)

  • Huh Myung-Hoe;Yang Kyung-Sook
    • The Korean Journal of Applied Statistics
    • /
    • v.18 no.3
    • /
    • pp.661-671
    • /
    • 2005
  • The aim of this study is to propose a clustering method, called tree-structured clustering, by recursively partitioning continuous multivariate dat a based on overall $R^2$ criterion with a practical node-splitting decision rule. The clustering method produces easily interpretable clustering rules of tree types with the variable selection function. In numerical examples (Fisher's iris data and a Telecom case), we note several differences between tree-structured clustering and K-means clustering.