• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.1
• /
• pp.74-82
• /
• 2015

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.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.663-667
• /
• 2010

A simple approach to semantic document-retrieval is to measure document similarity based on the bag-of-words representation, e.g., cosine similarity between two document vectors. However, such a syntactic method hardly considers the semantic similarity between documents, often producing semantically-unsound search results. We circumvent such a problem by combining supervised machine learning techniques with ontology information based on Markov logic. Specifically, Markov logic networks are learned from similarity-tagged documents with an ontology representing the diverse relationship among words. The learned Markov logic networks, the ontology, and the training documents are applied to the semantic document-retrieval task by inferring similarities between a query document and the training documents. Through experimental evaluation on real world question-answering data, the proposed method has been shown to outperform the simple cosine similarity-based approach in terms of retrieval accuracy.

• Korean Journal of Logic
• /
• v.8 no.1
• /
• pp.47-67
• /
• 2005

Bayesian networks have been used in studying and simulating causal inferences by using the probability function distributed over the variables consisting of inquiry space. The focus of the debates concerning Bayesian networks is the causal Markov condition that constrains the probabilistic independence between all the variables which are not in the causal relations. Cartwright, a strong critic about the Bayesian network theory, argues that the causal Markov condition cannot hold in indeterministic systems, so it cannot be a valid principle for causal inferences. The purpose of the paper is to explore whether her argument on the causal Markov condition is valid. Mainly, I shall argue that it is possible for upholders of the causal Markov condition to respond properly the criticism of Cartwright through the continuous causal model that permits the infinite sequence of causal events.

• Journal of Korea Multimedia Society
• /
• v.20 no.7
• /
• pp.1065-1072
• /
• 2017

As smart devices and social network services (SNSs) become increasingly pervasive, individuals produce large amounts of data in real time. Accordingly, studies on unstructured data analysis are actively being conducted to solve the resultant problem of information overload and to facilitate effective data processing. Many such studies are conducted for filtering inappropriate information. In this paper, a feature-weighting method considering SNS-message features is proposed for the classification of short text messages generated on SNSs, using Markov logic networks for category inference. The performance of the proposed method is verified through a comparison with an existing frequency-based classification methods.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.4
• /
• pp.285-294
• /
• 2007

In this paper, we investigate a novel online estimation algorithm for dynamic Bayesian network(DBN) parameters, given as conditional probabilities. We sequentially update the parameter adjustment rule based on observation data. We apply our algorithm to two well known representations of DBNs: to a first-order Markov Chain(MC) model and to a Hidden Markov Model(HMM). A sliding window allows efficient adaptive computation in real time. We also examine the stochastic convergence and stability of the learning algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.1
• /
• pp.37-42
• /
• 2010

Final year students are normally encountering high pressing in their study. In view of this fact, this research focuses on determining mental states condition of college student in final year based on the psycho-physiological information. The experiments were conducted in two times, i.e., prior- and post- graduation seminar examination. The early results indicated that the student profile of mood states (POMS) in prior final graduation seminar showed higher scores than students in post final graduation seminar. Thus, in this research, relation between biosignal representing by heart rate variability (HRV) and questionnaire responses were evaluated by hidden Markov model (HMM) and neural networks (NN).