• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.4
• /
• pp.249-255
• /
• 2016

Recently, transaction data is accumulated everywhere very rapidly. Association analysis methods are usually applied to analyze transaction data, but the methods have several problems. For example, these methods can only consider one-way relations among items and cannot reflect domain knowledge into analysis process. In order to overcome defect of association analysis methods, we suggest a transaction data analysis method based on probabilistic graphical model (PGM) in this study. The method we suggest has several advantages as compared with association analysis methods. For example, this method has a high flexibility, and can give a solution to various probability problems regarding the transaction data with relationships among items.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1386-1392
• /
• 2006

This study is a numerical representative modelling analysis for applying the process that unravels networks between cells in genetics to WWW of informatics. Using the probabilistic graphical model, the insight from the data describing biological networks is used for making a probabilistic function. Rather than a complex network of cells, we reconstruct a simple lower-stage model and show a genetic representation level from the genetic based network logic. We made probabilistic graphical models from genetic data and extends them to genetic representation data in the method of network modelling in informatics.

• KSBB Journal
• /
• v.21 no.4
• /
• pp.231-235
• /
• 2006

This study is a numerical representative modeling analysis for the application of the process that unravels networks between cells in genetics to web of informatics. Using the probabilistic graphical model, the insight from the data describing biological networks is used for making a probabilistic function. Rather than a complex network of cells, we reconstruct a simple lower-stage model and show a genetic representation level from the genetic based network logic. We made probabilistic graphical models from genetic data and extends them to genetic representation data in the method of network modeling in informatics

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.426-428
• /
• 2012

In order to identify proteins that are present in biological samples, these samples are separated and analyzed under the sequential procedure as follows: protein purification and digestion, peptide fragmentation by tandem mass spectrometry (MS/MS) which breaks peptides into fragments, peptide identification, and protein identification. One of the widely used methods for protein identification is based on probabilistic approaches such as ProteinProphet and BaysPro. However, they do not consider the difference in peptide identification probabilities according to their length. Here, we propose a probabilistic graphical model-based approach to protein identification from MS/MS data considering peptide identification probabilities, number of sibling peptides, and peptide length. We compared our approach with ProteinProphet using a yeast MS/MS dataset. As a result, our model identified 27 more proteins than ProteinProphet at 1% of FDR (false discovery rate), confirming the importance of peptide length information in protein identification.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.5
• /
• pp.649-656
• /
• 2011

This study is a numerical representative modelling analysis for applying the process that unravels networks between cells in genetics to Network of informatics. Using the probabilistic graphical model, the insight from the data describing biological networks is used for making a probabilistic function. Rather than a complex network of cells, we reconstruct a simple lower-stage model and show a genetic representation level from the genetic based network logic. We made probabilistic graphical models from genetic data and extend them to genetic representation data in the method of network modelling in informatics.

• 대한예방의학회:학술대회논문집
• /
• 1994.02b
• /
• pp.150-153
• /
• 1994

Receiver operating characteristic (ROC) curves have been frequently used to compare probability models applied to medical problems. Though the curves are a measure of the discriminatory power of a model. they do not reflect the model's accuracy. A supplementary accuracy curve is derived which will be coincident with the ROC curve if the model is reliable. will be above the ROC curve if the model's probabilities are too high or below if they are too low. A clinical example of this new graphical presentation is given.

• Advances in concrete construction
• /
• v.9 no.4
• /
• pp.337-343
• /
• 2020

In the present study, by employing fragility analysis, the seismic vulnerability of a concrete girder bridge, one of the most common existing structural bridge systems, has been performed. To this end, drift demand model as a fundamental ingredient of any probabilistic decision-making analyses is initially developed in terms of the two most common intensity measures, i.e., PGA and Sa (T₁). Developing a probabilistic demand model requires a reliable database that is established in this paper by performing incremental dynamic analysis (IDA) under a set of 20 ground motion records. Next, by employing Bayesian statistical inference drift demand models are developed based on pre-collapse data obtained from IDA. Then, the accuracy and reasonability of the developed models are investigated by plotting diagnosis graphs. This graphical analysis demonstrates probabilistic demand model developed in terms of PGA is more reliable. Afterward, fragility curves according to PGA based-demand model are developed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4814-4832
• /
• 2019

Plagiarism detection is increasingly exploiting text alignment. Text alignment involves extracting the plagiarism passages in a pair of the suspicious document and its source document. The heuristics have achieved excellent performance in text alignment. However, the further improvements of the heuristic methods mainly depends more on the experiences of experts, which makes the heuristics lack of the abilities for continuous improvements. To address this problem, machine learning maybe a proper way. Considering the position relations and the context of text segments pairs, we formalize the text alignment task as a problem of sequence labeling, improving the current methods at the model level. Especially, this paper proposes to use the probabilistic graphical model to tag the observed sequence of pairs of text segments. Hence we present the sequence labeling approach for text alignment in plagiarism detection based on Conditional Random Fields. The proposed approach is evaluated on the PAN@CLEF 2012 artificial high obfuscation plagiarism corpus and the simulated paraphrase plagiarism corpus, and compared with the methods achieved the best performance in PAN@CLEF 2012, 2013 and 2014. Experimental results demonstrate that the proposed approach significantly outperforms the state of the art methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.5
• /
• pp.684-690
• /
• 2007

We describe our method to predict the direction of conditional probabilistic dependencies between clusters of random variables. Selected variables called 'gateway variables' are used to predict the conditional probabilistic dependency relations between clusters. The direction of conditional probabilistic dependencies between clusters are predicted by finding directed acyclic graph (DAG)-shaped dependency structure between the gateway variables. We show that our method shows meaningful prediction results in determining directions of conditional probabilistic dependencies between clusters.

• Proceedings of the Korean Society for Cognitive Science Conference
• /
• 2010.05a
• /
• pp.60-65
• /
• 2010

Language learning involves linguistic environments around the learner. So the variation in training input to which the learner is exposed has been linked to their language learning. We explore how linguistic experiences can cause differences in learning linguistic structural features, as investigate in a probabilistic graphical model. We manipulate the amounts of training input, composed of natural linguistic data from animation videos for children, from holistic (one-word expression) to compositional (two- to six-word one) gradually. The recognition and generation of sentences are a "probabilistic" constraint satisfaction process which is based on massively parallel DNA chemistry. Random sentence generation tasks succeed when networks begin with limited sentential lengths and vocabulary sizes and gradually expand with larger ones, like children's cognitive development in learning. This model supports the suggestion that variations in early linguistic environments with developmental steps may be useful for facilitating language acquisition.