• Title/Summary/Keyword: 규칙화

Search Result 1,234, Processing Time 0.023 seconds

공정위 업무활동

  • The Korea Fair competition Federation
    • Journal of Korea Fair Competition Federation
    • /
    • no.126
    • /
    • pp.53-56
    • /
    • 2006
  • 독점규제및공정거래에관한법률 개정(안) 입법예고/ 방문판매 등에 관한 법률 시행령 및 시행규칙 개정안 입법예고/ 소비자피해 방지 위해 미등록 다단계판매업자 단속 강화/ 하도급관련 교육 확대 · 상설화/ 2006.4월중 상호출자제한기업집단 등의 소속회사 변동 현황/

  • PDF

Multi-classifier Decision-level Fusion for Face Recognition (다중 분류기의 판정단계 융합에 의한 얼굴인식)

  • Yeom, Seok-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.4
    • /
    • pp.77-84
    • /
    • 2012
  • Face classification has wide applications in intelligent video surveillance, content retrieval, robot vision, and human-machine interface. Pose and expression changes, and arbitrary illumination are typical problems for face recognition. When the face is captured at a distance, the image quality is often degraded by blurring and noise corruption. This paper investigates the efficacy of multi-classifier decision level fusion for face classification based on the photon-counting linear discriminant analysis with two different cost functions: Euclidean distance and negative normalized correlation. Decision level fusion comprises three stages: cost normalization, cost validation, and fusion rules. First, the costs are normalized into the uniform range and then, candidate costs are selected during validation. Three fusion rules are employed: minimum, average, and majority-voting rules. In the experiments, unfocusing and motion blurs are rendered to simulate the effects of the long distance environments. It will be shown that the decision-level fusion scheme provides better results than the single classifier.

Empathy Recognition Method Using Synchronization of Heart Response (심장 반응 동기화를 이용한 공감 인식 방법)

  • Lee, Dong Won;Park, Sangin;Mun, Sungchul;Whang, Mincheol
    • Science of Emotion and Sensibility
    • /
    • v.22 no.1
    • /
    • pp.45-54
    • /
    • 2019
  • Empathy has been observed to be pivotal in enhancing both social relations and the efficiency of task performance. Empathetic interaction has been shown to begin with individuals mirroring each other's facial expressions, vocal tone, actions, and so on. The internal responses of the cardiovascular activity of people engaged in empathetic interaction are also known to be synchronized. This study attempted to objectively and quantitatively define the rules of empathy with regard to the synchronization of cardiac rhythm between persons. Seventy-four subjects participated in the investigation and were paired to imitate the facial expressions of their partner. An electrocardiogram (ECG) measurement was taken as the participants conducted the task. Quantitative indicators were extracted from the heart rhythm pattern (HRP) and the heart rhythm coherence (HRC) to determine the difference of synchronization of heart rhythms between two individuals as they pertained to empathy. Statistical significance was confirmed by an independent sample t-test. The HRP and HRC correlation(r) between persons increased significantly with empathy in comparison to an interaction that was not empathetic. A difference of the standard deviation of NN intervals (SDNN) and the dominant peak frequency decreased. Therefore, significant parameters to evaluate empathy have been proposed through a step-wise discrimination analysis. Empathic interactions may thus be managed and monitored for high quality social interaction and communication.

Light Weight Korean Morphological Analysis Using Left-longest-match-preference model and Hidden Markov Model (좌최장일치법과 HMM을 결합한 경량화된 한국어 형태소 분석)

  • Kang, Sangwoo;Yang, Jaechul;Seo, Jungyun
    • Korean Journal of Cognitive Science
    • /
    • v.24 no.2
    • /
    • pp.95-109
    • /
    • 2013
  • With the rapid evolution of the personal device environment, the demand for natural language applications is increasing. This paper proposes a morpheme segmentation and part-of-speech tagging model, which provides the first step module of natural language processing for many languages; the model is designed for mobile devices with limited hardware resources. To reduce the number of morpheme candidates in morphological analysis, the proposed model uses a method that adds highly possible morpheme candidates to the original outputs of a conventional left-longest-match-preference method. To reduce the computational cost and memory usage, the proposed model uses a method that simplifies the process of calculating the observation probability of a word consisting of one or more morphemes in a conventional hidden Markov model.

  • PDF

Personalized Recommendation System using FP-tree Mining based on RFM (RFM기반 FP-tree 마이닝을 이용한 개인화 추천시스템)

  • Cho, Young-Sung;Ho, Ryu-Keun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.2
    • /
    • pp.197-206
    • /
    • 2012
  • A exisiting recommedation system using association rules has the problem, such as delay of processing speed from a cause of frequent scanning a large data, scalability and accuracy as well. In this paper, using a Implicit method which is not used user's profile for rating, we propose the personalized recommendation system which is a new method using the FP-tree mining based on RFM. It is necessary for us to keep the analysis of RFM method and FP-tree mining to be able to reflect attributes of customers and items based on the whole customers' data and purchased data in order to find the items with high purchasability. The proposed makes frequent items and creates association rule by using the FP-tree mining based on RFM without occurrence of candidate set. We can recommend the items with efficiency, are used to generate the recommendable item according to the basic threshold for association rules with support, confidence and lift. To estimate the performance, the proposed system is compared with existing system. As a result, it can be improved and evaluated according to the criteria of logicality through the experiment with dataset, collected in a cosmetic internet shopping mall.

Backward Reasoning in Fuzzy Petri - net Representation for Fuzzy Production Rules (퍼지생성규칙을 위한 퍼지페트리네트표현에서 후진추론)

  • Cho, Sang-Yeop
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.4
    • /
    • pp.951-958
    • /
    • 1998
  • In this paper, we propose a backward reasoning algorithm which can be utilized in the fuzzy Petri-net representation representing fuzzy production rules. The fuzzy Petri-net representation can be used to model a approximate reasoning system and implement a fuzzy inference engine. The proposed algorithm, which uses the proper belief evaluation functions according to fuzzy concepts in antecedentes and consequents of fuzzy production rules, is more closer to human intuition and reasoning than other methods. This algorithm generates the backward reasoning path from the goal to the initial nodes and evaluates the belief value of the goal node using belief evaluation functions.

  • PDF

Retrospective Maximum Likelihood Decision Rule for Tag Cognizance in RFID Networks (RFID 망에서 Tag 인식을 위한 회고풍의 최대 우도 결정 규칙)

  • Kim, Joon-Mo;Park, Jin-Kyung;Ha, Jun;Seo, Hee-Won;Choi, Cheon-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.2
    • /
    • pp.21-28
    • /
    • 2011
  • We consider an RFID network configured as a star in which tags stationarily move into and out of the vicinity of the reader. To cognize the neighboring tags in the RFID network, we propose a scheme based on dynamic framed and slotted ALOHA which determines the number of slots belonging to a frame in a dynamic fashion. The tag cognizance scheme distinctively employs a rule for estimating the expected number of neighboring tags, identified as R-retrospective maximum likelihood rule, where the observations attained in the R previous frames are used in maximizing the likelihood of expected number of tags. Simulation result shows that a slight increase in depth of retrospect is able to significantly improve the cognizance performance.

Association Rule Discovery Considering Strategic Importance: WARM (전략적 중요도를 고려한 연관규칙의 발견: WARM)

  • Choi, Doug-Won
    • The KIPS Transactions:PartD
    • /
    • v.17D no.4
    • /
    • pp.311-316
    • /
    • 2010
  • This paper presents a weight adjusted association rule mining algorithm (WARM). Assigning weights to each strategic factor and normalizing raw scores within each strategic factor are the key ideas of the presented algorithm. It is an extension of the earlier algorithm TSAA (transitive support association Apriori) and strategic importance is reflected by considering factors such as profit, marketing value, and customer satisfaction of each item. Performance analysis based on a real world database has been made and comparison of the mining outcomes obtained from three association rule mining algorithms (Apriori, TSAA, and WARM) is provided. The result indicates that each algorithm gives distinct and characteristic behavior in association rule mining.

A Design of dynamic routing and Operating Rules for Improving the Transportation in Hinterland (배후단지 수배송 효율화를 위한 동적계획 및 운영규칙 설계)

  • Ha, Chang-Seung;Kwak, Kyu-Seok
    • Journal of Navigation and Port Research
    • /
    • v.35 no.3
    • /
    • pp.235-241
    • /
    • 2011
  • The shuttle that currently connects Busan New Port to the logistics companies in the Hinterland has the following companies: first, resources are consumed redundantly as each logistics company has independent transport vehicles. Second, the companies are not taking advantage of geographical merits of clustered complexes because different vehicles are used each time due to irregular schedules. In this respect, this study had the following purposes to realize these solutions: first, heuristic approach was made for operation scheduling and real-time operating rules to configure the best possible dynamic plan. Second, the reduction of consumption of resources with the shuttle and the efficiency were examined through a simulation of pooling and dual cycling applied to logistics companies' shipping plans.