Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 허선 | - |
dc.date.accessioned | 2023-07-12T01:15:57Z | - |
dc.date.available | 2023-07-12T01:15:57Z | - |
dc.date.issued | 2015-03 | - |
dc.identifier.citation | 한국산업경영시스템학회지, v. 38, NO. 1, Page. 74-82 | - |
dc.identifier.issn | 2005-0461;2287-7975 | - |
dc.identifier.uri | http://db.koreascholar.com/Article?code=319648 | en_US |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/182891 | - |
dc.description.abstract | Two key challenges in statistical relational learning are uncertainty and complexity. Standard frameworks for handling uncertainty are probability and first-order logic respectively. A Markov logic network (MLN) is a first-order knowledge base with weights attached to each formula and is suitable for classification of dataset which have variables correlated with each other. But we need domain knowledge to construct first-order logics and a computational complexity problem arises when calculating weights of first-order logics. To overcome these problems we suggest a method to generate first-order logics and learn weights using association analysis in this study. | - |
dc.language | ko | - |
dc.publisher | 한국산업경영시스템학회 | - |
dc.subject | Statistical Relational Learning | - |
dc.subject | Markov Logic Network | - |
dc.subject | Association Rule | - |
dc.subject | Knowledge-Based Model | - |
dc.subject | First-Order Logic | - |
dc.title | 연관분석을 이용한 마코프 논리네트워크의1차 논리 공식 생성과 가중치 학습방법 | - |
dc.title.alternative | First-Order Logic Generation and Weight Learning Method in Markov Logic Network Using Association Analysis | - |
dc.type | Article | - |
dc.relation.no | 1 | - |
dc.relation.volume | 38 | - |
dc.relation.page | 74-82 | - |
dc.relation.journal | 한국산업경영시스템학회지 | - |
dc.contributor.googleauthor | 안길승 | - |
dc.contributor.googleauthor | 허선 | - |
dc.sector.campus | E | - |
dc.sector.daehak | 공학대학 | - |
dc.sector.department | 산업경영공학과 | - |
dc.identifier.pid | hursun | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.