DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Sung-Ho | - |
dc.contributor.advisor | 김성호 | - |
dc.contributor.author | Choi, Hye-Yoon | - |
dc.contributor.author | 최혜윤 | - |
dc.date.accessioned | 2013-09-12T02:33:43Z | - |
dc.date.available | 2013-09-12T02:33:43Z | - |
dc.date.issued | 2011 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=467730&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/181612 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 수리과학과, 2011.2, [ iv, 34 p. ] | - |
dc.description.abstract | Data mining is the whole procedure of analyzing patterns between some objects. Due to its importance in wide range of areas such as business, science and technology, the methods for proceeding this job are developed from early century. Especially, inventing computers enables us to create many efficient tools including Random Forest. Classification is one of the form of data mining. The key objective of classification is the generalization of known structure from given data. We can use the Bayesian Network, a kind of classification, to analyzing the relations between random variables under suitable conditions. Bayesian Network is the graph-shaped modeling relations between random variables. Each variable supported by $\{0,1 \}$ can be expressed by nodes of graph. Their relations also can be described by edges. This method includes a lot of graphical model structure to find correct one such as undirected graph model, directed acyclic graph model and chain model. This modeling among variables can allow us to recognize whole structure easily. Directed acyclic graphical model, especially, contains a bunch of information even though it is hard to determine. To find the true structure, people must do several jobs. Before analyzing given data, we should get information about a whole situation which we can gain. It is sometimes very useful ingredient for deciding structure. There exist two ways to find undirected edges for objective reasons. One is to find undirected graphical model. This can do by a variety of tools such as log-linear modeling. The other is to determine the previous structure of directed acyclic graph model before deciding orientations. We will introduce this by using the package Random Forest. Finally, we should decide the directions of edges. Unfortunately, there is no standard program for doing this. But as we study the characteristic of relations between nodes such as independency, we can determine the orientations. Also we use the knowledge o... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Structure learning | - |
dc.subject | Bayesian network | - |
dc.subject | random forest | - |
dc.subject | 구조학습 | - |
dc.subject | 베이지안망 모형 | - |
dc.subject | 랜덤포레스트 | - |
dc.subject | 독립성검정 | - |
dc.subject | independence test | - |
dc.title | Structure learning of Bayesian networks using random forest and independence test | - |
dc.title.alternative | 랜덤포레스트와 독립성검정을 사용한 베이지안망 모형의 구조학습 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 467730/325007 | - |
dc.description.department | 한국과학기술원 : 수리과학과, | - |
dc.identifier.uid | 020093564 | - |
dc.contributor.localauthor | Kim, Sung-Ho | - |
dc.contributor.localauthor | 김성호 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.