Prediction of Chinese Financial Total Loan Amount via Unbiased Grey-Fuzzy-Markov Chain Method

2015 ◽  
Author(s):  
Yinan Yang ◽  
Jingyi Zeng ◽  
Jingyun Wang ◽  
Ziqi Tang
Keyword(s):  
Markov Chain ◽  
Markov Chain Method ◽  
Fuzzy Markov Chain ◽  
Loan Amount

UGLEO: A WEB BASED INTELLIGENCE CHATBOT FOR STUDENT ADMISSION PORTAL USING MEGAHAL STYLE

2018 ◽  
Vol 23 (3) ◽  
pp. 175-191
Author(s):  
Anneke Annassia Putri Siswadi ◽  
Avinanta Tarigan
Keyword(s):  
Markov Chain ◽  
Natural Language Processing ◽  
Natural Language ◽  
Language Processing ◽  
Information Need ◽  
Web Based ◽  
Markov Chain Method ◽  
Information Center

To fulfill the prospective student's information need about student admission, Gunadarma University has already many kinds of services which are time limited, such as website, book, registration place, Media Information Center, and Question Answering’s website (UG-Pedia). It needs a service that can serve them anytime and anywhere. Therefore, this research is developing the UGLeo as a web based QA intelligence chatbot application for Gunadarma University's student admission portal. UGLeo is developed by MegaHal style which implements the Markov Chain method. In this research, there are some modifications in MegaHal style, those modifications are the structure of natural language processing and the structure of database. The accuracy of UGLeo reply is 65%. However, to increase the accuracy there are some improvements to be applied in UGLeo system, both improvement in natural language processing and improvement in MegaHal style.

On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing

1987 ◽  
Vol 1 (1) ◽  
pp. 33-46 ◽  
Author(s):  
David Aldous
Keyword(s):  
Markov Chain ◽  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Simulation Method ◽  
Careful Analysis ◽  
Eigenvalue Estimate ◽  
Uniform Distributions ◽  
Markov Chain Method ◽  
Annealing Algorithm ◽  
Second Largest Eigenvalue

Uniform distributions on complicated combinatorial sets can be simulated by the Markov chain method. A condition is given for the simulations to be accurate in polynomial time. Similar analysis of the simulated annealing algorithm remains an open problem. The argument relies on a recent eigenvalue estimate of Alon [4]; the only new mathematical ingredient is a careful analysis of how the accuracy of sample averages of a Markov chain is related to the second-largest eigenvalue.

Sign in / Sign up

Export Citation Format

Share Document