Articles

  1. Loc Nguyen (2017, November 2). Converting Graphic Relationships into Conditional Probabilities in Bayesian Network
    Type Book Chapter
    Abstract Bayesian network is a powerful mathematical tool for prediction and diagnosis applications. A large Bayesian network can be constituted of many simple networks which in turn are constructed from simple graphs. A simple graph consists of one child node and many parent nodes. The strength of each relationship between a child node and a parent node is quantified by a weight and all relationships share the same semantics such as prerequisite, diagnostic, and aggregation. The research focuses on converting graphic relationships into conditional probabilities in order to construct a simple Bayesian network from a graph. Diagnostic relationship is the main research object, in which sufficient diagnostic proposition is proposed for validating diagnostic relationship. Relationship conversion is adhered to logic gates such as AND, OR, and XOR, which is essential feature of the research.
    Keywords: diagnostic relationship, Bayesian network, transformation coefficient.
    Published In Javier Prieto Tejedor (Author, Editor), Bayesian Inference, pages 97-143. Publication date is November 2, 2017.
    ISBN online: 978-953-51-3578-4. ISBN print: 978-953-51-3577-7. Open Access. Paperback: 380 pages.
    Publisher: InTech.
    Place: Janeza Trdine 9, 51000 Rijeka, Croatia.
    Identifiers DOI: 10.5772/intechopen.70057
    Links https://www.intechopen.com/books/bayesian-inference/converting-graphic-relationships-into-conditional-probabilities-in-bayesian-network
    Citations Nguyen, L. (2017, November 2). Converting Graphic Relationships into Conditional Probabilities in Bayesian Network. In J. P. Tejedor, & J. P. Tejedor (Ed.), Bayesian Inference (pp. 97-143). Rijeka, Croatia: InTech. doi:10.5772/intechopen.70057
    Cited
    Indexed
    Metrics
    Categories Mathematics, Computer Science

     

  2. Loc Nguyen (2017, April 24). A Proposal of Loose Asymmetric Cryptography Algorithm
    Type Conference Paper
    Abstract Although traditional asymmetric algorithm along with its implementations are successful in keeping important documents confidential, it uses only one private key. This research proposes the loose asymmetric (LA) algorithm to satisfy requirement of generating many access keys. Each access key is granted to only one user. This demand is real because a group of members needs to retrieve same documents but each member requires confidentiality in access. Because implementation of LA algorithm is complicated, I also propose two schemes of how to deploy LA algorithm. The research is a proposal because I do not make experiment on LA algorithm yet.
    Keywords: Asymmetric algorithm, Linear algebra, Mask matrix, Access key.
    Published Proceedings of The 2nd International Conference on Software, Multimedia and Communication Engineering (SMCE 2017), DEStech Transactions on Computer Science and Engineering, pages 414-422.
    ISBN: 978-1-60595-458-5, ISSN: 2475-8841.
    Publisher: DEStech.
    Place and date: Shanghai, China, April 23-24, 2017.
    Identifiers DOI: 10.12783/dtcse/smce2017/12462
    Links http://dpi-proceedings.com/index.php/dtcse/article/view/12462
    Citations Nguyen, L. (2017, April 24). A Proposal of Loose Asymmetric Cryptography Algorithm. Proceedings of The 2nd International Conference on Software, Multimedia and Communication Engineering (SMCE 2017), DEStech Transactions on Computer Science and Engineering (pp. 414-422). Shanghai: DEStech. doi:10.12783/dtcse/smce2017/12462
    Cited
    Indexed CNKI, Ei, Thomson Reuters - CPCI
    Metrics
    Categories Computer Science, Mathematics
    Charged

     

  3. Loc Nguyen (2017, June 9). Global Optimization with Descending Region Algorithm
    Type Journal Article
    Abstract Global optimization is necessary in some cases when we want to achieve the best solution or we require a new solution which is better the old one. However global optimization is a hazard problem. Gradient descent method is a well-known technique to find out local optimizer whereas approximation solution approach aims to simplify how to solve the global optimization problem. In order to find out the global optimizer in the most practical way, I propose a so-called descending region (DR) algorithm which is combination of gradient descent method and approximation solution approach. The ideology of DR algorithm is that given a known local minimizer, the better minimizer is searched only in a so-called descending region under such local minimizer. Descending region is begun by a so-called descending point which is the main subject of DR algorithm. Descending point, in turn, is solution of intersection equation (A). Finally, I prove and provide a simpler linear equation system (B) which is derived from (A). So (B) is the most important result of this research because (A) is solved by solving (B) many enough times. In other words, DR algorithm is refined many times so as to produce such (B) for searching for the global optimizer. I propose a so-called simulated Newton – Raphson (SNR) algorithm which is a simulation of Newton – Raphson method to solve (B). The starting point is very important for SNR algorithm to converge. Therefore, I also propose a so-called RTP algorithm, which is refined and probabilistic process, in order to partition solution space and generate random testing points, which aims to estimate the starting point of SNR algorithm. In general, I combine three algorithms such as DR, SNR, and RTP to solve the hazard problem of global optimization. Although the approach is division and conquest methodology in which global optimization is split into local optimization, solving equation, and partitioning, the solution is synthesis in which DR is backbone to connect itself with SNR and RTP.
    Keywords: Global Optimization, Gradient Descent Method, Descending Region, Descending Point.
    Published Special Issue “Some Novel Algorithms for Global Optimization and Relevant Subjects, Applied and Computational Mathematics (ACM), Volume 6, Issue 4-1, pages 72-82. Publication date is June 9, 2017.
    ISSN print: 2328-5605, ISSN online: 2328-5613, Open Access.
    Editors of Special Issue: L. Nguyen, & et al.
    Publisher: Science Publishing Group.
    Presented The 3rd Science & Technology Conference of Ho Chi Minh University of Food & Industry, held on July 4, 2017, Ho Chi Minh, Vietnam.
    Identifiers DOI: 10.11648/j.acm.s.2017060401.17
    Links http://www.sciencepublishinggroup.com/journal/paperinfo?journalid=147&doi=10.11648/j.acm.s.2017060401.17
    Citations Nguyen, L. (2017, June 9). Global Optimization with Descending Region Algorithm. (L. Nguyen, & et al., Eds.) Special Issue “Some Novel Algorithms for Global Optimization and Relevant Subjects, Applied and Computational Mathematics (ACM), 6(4-1), 72-82. doi:10.11648/j.acm.s.2017060401.17
    Cited
    Indexed Academic Keys, ARDI, CNKI, CrossRef, DRJI, EZB, Journal Seek, MIAR, PBN, Research Bible, WorldCat, WZB, ZDB, Zentralblatt MATH.
    Metrics
    Categories Mathematics

     

  4. Loc Nguyen, Thu-Hang T. Ho (2017, March 13). Experimental Results of Phoebe Framework: Optimal Formulas for Estimating Fetus Weight and Age
    Type Journal Article
    Abstract Fetal age and weight estimation plays an important role in pregnant treatments. There are many estimate formulas created by combination of statistics and obstetrics. However, such formulas give optimal estimation if and only if they are applied into specified community. We proposed a so-called Phoebe framework that supports scientists to find out most accurate formulas with regard to the community where scientists do their research. Now we compose this paper that focuses on using Phoebe framework to derive optimal formulas from experimental results. In other words, this paper is an evaluation of Phoebe framework.
    Keywords: fetal age estimation, fetal weight estimation, regression model, estimate formula.
    Published Journal of Community & Public Health Nursing, Volume 3, Issue 2, pages 1-5. Publication date is March 13, 2017.
    ISSN: 2471-9846, Open Access.
    Editors: Helen J. C. Shaji, Mari Carmen Portillo, Martin M. Zdanowicz.
    Publisher: OMICS.
    Presented Poster presentation at The 7th Mekong Delta Obstetrics & Gynaecology Conference, held on July 29, 2017, Can Tho, Vietnam.
    Identifiers DOI: 10.4172/2471-9846.1000163
    Links https://goo.gl/qiMOXh
    Citations Nguyen, L., & Ho, Thu-Hang T. (2017, March 13). Experimental Results of Phoebe Framework: Optimal Formulas for Estimating Fetus Weight and Age. (H. J. Shaji, M. C. Portillo, & M. M. Zdanowicz, Eds.) Journal of Community & Public Health Nursing, 3(2), 1-5. doi:10.4172/2471-9846.1000163
    Cited
    Indexed EBSCO, Hamdard University, Publons, RefSeek, WorldCat
    Metrics
    Categories Statistics, Medicine

     

  5. Loc Nguyen (2016, October 31). Beta Likelihood Estimation in Learning Bayesian Network Parameter
    Type Book Chapter
    Abstract Maximum likelihood estimation (MLE) is a popular technique of statistical parameter estimation. When random variable conforms beta distribution, the research focuses on applying MLE into beta density function. This method is called beta likelihood estimation (BLE), which results out useful estimation equations. It is easy to calculate statistical estimates based on these equations in case that parameters of beta distribution are positive integer numbers. Although I wrote two articles relevant to BLE and its application to specify prior probabilities of Bayesian network, this chapter is a full report of BLE in learning Bayesian network parameter, which takes advantages of interesting features of analytic functions such as gamma, digamma, and trigamma.
    Keywords: Maximum likelihood estimation, beta distribution, beta likelihood estimation, gamma function, Bayesian network parameter.
    Published In United Scholars Publications (Author), Advances in Computer Networks and Information Technology (Vol. II), pages 17-82. Publication date is October 31, 2016.
    ISBN-10: 1539855228. ISBN-13: 978-1539855224. Paperback: 214 pages
    Publisher: CreateSpace Independent Publishing Platform.
    Identifiers
    Links https://www.amazon.com/dp/1539855228
    Citations Nguyen, L. (2016, October 31). Beta Likelihood Estimation in Learning Bayesian Network Parameter. In United Scholars Publications (Author), Advances in Computer Networks and Information Technology (Vol. II). USA: CreateSpace Independent Publishing Platform. Retrieved from https://www.amazon.com/dp/1539855228
    Cited
    Indexed
    Metrics
    Categories Mathematics

     

  6. Loc Nguyen (2016, October 18). Estimating Peak Bone Mineral Density in Osteoporosis Diagnosis by Maximum Distribution
    Type Journal Article
    Abstract The T-score is very important to diagnosis of osteoporosis and its formula is calculated from two parameters such as peak bone mineral density (pBMD) and variance of pBMD. This research proposes a new method to estimate these parameters with recognition that pBMD conforms maximum distributions, for instance, Gumbel distribution. Firstly, my method models pBMD sample as a series of maximum values and such values are assumed to obey Gumbel distribution. Secondly, I apply moment technique to estimate mean and variance of Gumbel distribution with regard to the series of maximum values. These mean and variance are adjusted to become the best estimates of pBMD and pBMD variance. There is no normality assumption in this research because pBMD is essentially the extreme value with low frequency in population and so the estimate of pBMD will be more accurate if we take full advantage of specific characteristics of Gumbel maximum distribution.
    Keywords: Peak Bone Mineral Density, Osteoporosis Diagnosis, Gumbel Maximum Distribution.
    Published International Journal of Clinical Medicine Research (IJCMR), Vol. 3, No. 5, pages 76-80. Publication date is October 18, 2016.
    ISSN: 2375-3838, Open Access.
    Editors: Editorial Board.
    Publisher: American Association for Science and Technology (AASCIT).
    Identifiers
    Links http://www.aascit.org/journal/archive2?journalId=906&paperId=4532
    Citations Nguyen, L. (2016, October 18). Estimating Peak Bone Mineral Density in Osteoporosis Diagnosis by Maximum Distribution. International Journal of Clinical Medicine Research (IJCMR), 3(5), 76-80. Retrieved from http://www.aascit.org/journal/archive2?journalId=906&paperId=4532
    Cited
    Indexed Academic Keys, DRJI, MIAR, PBN, Research Bible, WorldCat
    Metrics
    Categories Statistics, Medicine

     

  7. Loc Nguyen (2016, August 18). A New Aware-context Collaborative Filtering Approach by Applying Multivariate Logistic Regression Model into General User Pattern
    Type Journal Article
    Abstract Traditional collaborative filtering (CF) does not take into account contextual factors such as time, place, companion, environment, etc. which are useful information around users or relevant to recommender application. So, recent aware-context CF takes advantages of such information in order to improve the quality of recommendation. There are three main aware-context approaches: contextual pre-filtering, contextual post-filtering and contextual modeling. Each approach has individual strong points and drawbacks but there is a requirement of steady and fast inference model which supports the aware-context recommendation process. This paper proposes a new approach which discovers multivariate logistic regression model by mining both traditional rating data and contextual data. Logistic model is optimal inference model in response to the binary question “whether or not a user prefers a list of recommendations with regard to contextual condition”. Consequently, such regression model is used as a filter to remove irrelevant items from recommendations. The final list is the best recommendations to be given to users under contextual information. Moreover the searching items space of logistic model is reduced to smaller set of items so-called general user pattern (GUP). GUP supports logistic model to be faster in real-time response.
    Keywords: aware-context collaborative filtering, logistic regression model.
    Published Journal of Data Analysis and Information Processing (JDAIP), Vol.4 No.3, August 2016, pages 124-131. Publication date is August 18, 2016.
    ISSN online: 2327-7203, ISSN print: 2327-7211, Open Access.
    Editor-in-Chief: Feng Shi.
    Publisher: Scientific Research Publishing (SCIRP).
    Identifiers DOI: 10.4236/jdaip.2016.43011
    Links http://www.scirp.org/Journal/PaperInformation.aspx?PaperID=69840
    Citations Nguyen, L. (2016, August 18). A New Aware-context Collaborative Filtering Approach by Applying Multivariate Logistic Regression Model into General User Pattern. (F. Shi, Ed.) Journal of Data Analysis and Information Processing (JDAIP), 4(3), 124-131. doi:10.4236/jdaip.2016.43011
    Cited
    Indexed Academic Keys, ARDI, Blyun, CALIS, CNKI Scholar, CNPLINKER, CrossRef, EBSCO, EZB, Google Scholar, i-Scholar, Open Access Library, Open J-Gate, PBN, Research Bible, SciLit, SHERPA, WorldCat, ZDB.
    Metrics The 2-year Google-based Journal Impact Factor 2-GJIF (July 2016): 1.04
    Categories Statistics, Computer Science

     

  8. Loc Nguyen (2016, June 17). Longest-path Algorithm to Solve Uncovering Problem of Hidden Markov Model
    Type Journal Article
    Abstract Uncovering problem is one of three main problems of hidden Markov model (HMM), which aims to find out optimal state sequence that is most likely to produce a given observation sequence. Although Viterbi is the best algorithm to solve uncovering problem, I introduce a new viewpoint of how to solve HMM uncovering problem. The proposed algorithm is called longest-path algorithm in which the uncovering problem is modeled as a graph. So the essence of longest-path algorithm is to find out the longest path inside the graph. The optimal state sequence which is solution of uncovering problem is constructed from such path.
    Keywords: Hidden Markov Model, Uncovering Problem, Longest-path Algorithm.
    Published Special Issue “Some Novel Algorithms for Global Optimization and Relevant Subjects, Applied and Computational Mathematics (ACM), Vol. 6, No. 4-1, pages 39-47. Publication date is June 17, 2016.
    ISSN print: 2328-5605, ISSN online: 2328-5613, Open Access.
    Editors of Special Issue: Loc Nguyen, Dr. Mohamed Arezki MELLAL.
    Publisher: Science Publishing Group.
    Identifiers DOI: 10.11648/j.acm.s.2017060401.13
    Links http://www.sciencepublishinggroup.com/journal/paperinfo?journalid=147&doi=10.11648/j.acm.s.2017060401.13
    Citations Nguyen, L. (2016, June 17). Longest-path Algorithm to Solve Uncovering Problem of Hidden Markov Model. (L. Nguyen, & M. A. MELLAL, Eds.) Special Issue “Some Novel Algorithms for Global Optimization and Relevant Subjects, Applied and Computational Mathematics (ACM), 6(4-1), 39-47. doi:10.11648/j.acm.s.2017060401.13
    Cited
    Indexed Academic Keys, ARDI, CNKI, CrossRef, DRJI, EZB, Journal Seek, MIAR, PBN, Research Bible, WorldCat, WZB, ZDB, Zentralblatt MATH.
    Metrics
    Categories Mathematics, Computer Science

     

  9. Loc Nguyen (2016, June 17). Tutorial on Hidden Markov Model
    Type Journal Article
    Abstract Hidden Markov model (HMM) is a powerful mathematical tool for prediction and recognition. Many computer software products implement HMM and hide its complexity, which assist scientists to use HMM for applied researches. However comprehending HMM in order to take advantages of its strong points requires a lot of efforts. This report is a tutorial on HMM with full of mathematical proofs and example, which help researchers to understand it by the fastest way from theory to practice. The report focuses on three common problems of HMM such as evaluation problem, uncovering problem, and learning problem, in which learning problem with support of optimization theory is the main subject.
    Keywords: Hidden Markov Model, Optimization, Evaluation Problem, Uncovering Problem, Learning Problem.
    Published Special Issue “Some Novel Algorithms for Global Optimization and Relevant Subjects, Applied and Computational Mathematics (ACM), Vol. 6, No. 4-1, pages 16-38. Publication date is June 17, 2016.
    ISSN print: 2328-5605, ISSN online: 2328-5613, Open Access.
    Editors of Special Issue: Loc Nguyen, Dr. Mohamed Arezki MELLAL.
    Publisher: Science Publishing Group.
    Identifiers DOI: 10.11648/j.acm.s.2017060401.12
    Links http://www.sciencepublishinggroup.com/journal/paperinfo?journalid=147&doi=10.11648/j.acm.s.2017060401.12
    Citations Nguyen, L. (2016, June 17). Tutorial on Hidden Markov Model. (L. Nguyen, & M. A. MELLAL, Eds.) Special Issue “Some Novel Algorithms for Global Optimization and Relevant Subjects, Applied and Computational Mathematics (ACM), 6(4-1), 16-38. doi:10.11648/j.acm.s.2017060401.12
    Cited
    Indexed Academic Keys, ARDI, CNKI, CrossRef, DRJI, EZB, Journal Seek, MIAR, PBN, Research Bible, WorldCat, WZB, ZDB, Zentralblatt MATH
    Metrics
    Categories Mathematics, Computer Science

     

  10. Loc Nguyen (2016, June 17). Tutorial on Support Vector Machine
    Type Journal Article
    Abstract Support vector machine is a powerful machine learning method in data classification. Using it for applied researches is easy but comprehending it for further development requires a lot of efforts. This report is a tutorial on support vector machine with full of mathematical proofs and example, which help researchers to understand it by the fastest way from theory to practice. The report focuses on theory of optimization which is the base of support vector machine.
    Keywords: Support Vector Machine, Optimization, Separating Hyperplane, Sequential Minimal Optimization.
    Published Special Issue “Some Novel Algorithms for Global Optimization and Relevant Subjects, Applied and Computational Mathematics (ACM), Vol. 6, No. 4-1, pages 1-15. Publication date is June 17, 2016.
    ISSN print: 2328-5605, ISSN online: 2328-5613, Open Access.
    Editors of Special Issue: Loc Nguyen, Dr. Mohamed Arezki MELLAL.
    Publisher: Science Publishing Group.
    Identifiers DOI: 10.11648/j.acm.s.2017060401.11
    Links http://www.sciencepublishinggroup.com/journal/paperinfo?journalid=147&doi=10.11648/j.acm.s.2017060401.11
    Citations Nguyen, L. (2016, June 17). Tutorial on Support Vector Machine. (L. Nguyen, & M. A. MELLAL, Eds.) Special Issue “Some Novel Algorithms for Global Optimization and Relevant Subjects, Applied and Computational Mathematics (ACM), 6(4-1), 1-15. doi:10.11648/j.acm.s.2017060401.11
    Cited Google Scholar Cited by (September, 2017): 2, 1.
    Indexed Academic Keys, ARDI, CNKI, CrossRef, DRJI, EZB, Journal Seek, MIAR, PBN, Research Bible, WorldCat, WZB, ZDB, Zentralblatt MATH
    Metrics
    Categories Mathematics, Computer Science

     

  11. Loc Nguyen (2016, June 10). Continuous Observation Hidden Markov Model
    Type Journal Article
    Abstract Hidden Markov model (HMM) is a powerful mathematical tool for prediction and recognition but it is not easy to understand deeply its essential disciplines. Previously, I made a full tutorial on HMM in order to support researchers to comprehend HMM. However HMM goes beyond what such tutorial mentioned when observation may be signified by continuous value such as real number and real vector instead of discrete value. Note that state of HMM is always discrete event but continuous observation extends capacity of HMM for solving complex problems. Therefore, I do this research focusing on HMM in case that its observation conforms to a single probabilistic distribution. Moreover, mixture HMM in which observation is characterized by the mixture model of partial probability density functions is also mentioned. Mathematical proofs and practical techniques relevant to continuous observation HMM are main subjects of the research.
    Keywords: hidden Markov model, continuous observation, mixture model, evaluation problem, uncovering problem, learning problem.
    Published Kasmera Journal, Vol. 44 (no 6, Year 2016), pages 65-149. Publication date is June 10, 2016
    ISSN: 0075-5222
    Editor-in-chief: Prof. Dr. Miguel G. De Garcia.
    Publisher: ENFERMEDADES INFECCIOSAS Y TROPICALES, MARACAIBO, VENEZUELA.
    Awarded Good evaluation from Kasmera Journal
    Identifiers
    Links http://kasmerajournal.com/kasmer/index.php/archive/part/44/6/1/?currentVol=44&currentissue=6
    Citations Nguyen, L. (2016, June 10). Continuous Observation Hidden Markov Model. (M. G. De Garcia, Ed.) Kasmera Journal, 44(6), 65-149.
    Cited
    Indexed Academic Search Premier, CIRC, DOAJ, Fuente Academica Premier, Latindex, Scopus, SJR, Thomson Reuters-SCIE
    Metrics JCR 2014: Impact factor = 0.071, 5-Year impact factor = 0.071, Eigen factor Score = 0.00001, Article Influence Score = 0.011
    Categories Mathematics
    Charged Purchase on Kasmera Journal

     

  12. Loc Nguyen (2016, April 27). Beta Likelihood Estimation and Its Application to Specify Prior Probabilities in Bayesian Network
    Type Journal Article
    Abstract Maximum likelihood estimation (MLE) is a popular technique of statistical parameter estimation. When random variable conforms beta distribution, the research focuses on applying MLE into beta density function. This method is called beta likelihood estimation, which results out useful estimation equations. It is easy to calculate statistical estimates based on these equations in case that parameters of beta distribution are positive integer numbers. Essentially, the method takes advantages of interesting features of functions gamma, digamma, and trigamma. An application of beta likelihood estimation is to specify prior probabilities in Bayesian network.
    Keywords: maximum likelihood estimation, beta distribution, beta likelihood estimation, gamma function.
    Published British Journal of Mathematics & Computer Science, Volume 16, Issue 3, page 1-21. Publication date is April 27, 2016.
    ISSN: 2231-0851, DOI: 10.9734/bjmcs, Open Access.
    Editors and Reviewers: H. M. Srivastava, Paul Bracken, Radosław Jedynak, anonymous, S. Zimeras.
    Publisher: SCIENCEDOMAIN international.
    Identifiers DOI: 10.9734/BJMCS/2016/25731
    SDI Article No: BJMCS.25731
    Links http://sciencedomain.org/abstract/14364
    Peer-review History
    Citations Nguyen, L. (2016, April 27). Beta Likelihood Estimation and Its Application to Specify Prior Probabilities in Bayesian Network. (H. M. Srivastava, P. Bracken, R. Jedynak, anonymous, & S. Zimeras, Eds.) British Journal of Mathematics, 16(3), 1-21. doi:10.9734/BJMCS/2016/25731.
    Indexed BIBSYS, CrossRef, DOAJ, E-Journals.Org, EBSCO, Google Scholar, Journal Seek, Open J-Gate, Polish Ministry of Science and Higher Education, ProQuest, Research Bible, SHERPA, The Knowledge Network, UlrichsWeb, WorldCat, WRLC Catalog, WZB, Zentralblatt MATH
    Metrics SDI Average Peer review marks at publication stage: 8.5/10
    Being applied for Thomson Reuters indexing
    Categories Mathematics

     

  13. Loc Nguyen (2016, April 8). New version of CAT algorithm by maximum likelihood estimation
    Type Journal Article
    Abstract Computer-based testing with support of internet and computer is better than traditional paper-based testing. Computerized Adaptive Testing (CAT) is the branch of computer-based testing but it improves the accuracy of test core when CAT system tries to choose items such as tests, exams, and questions that are suitable to examinees’ abilities. I propose an advanced CAT algorithm based on two mathematical findings such as equation to estimate ability of a given examinee and equation to estimate ability variance among examinees. Such two mathematical equations are derived from maximum likelihood estimation of Item Response Function. The advanced CAT algorithm aims to classify examinees by the best way according to these equations.
    Keywords: Computerized Adaptive Testing, CAT, Item Response Function, Maximum Likelihood Estimation, ability estimate, ability variance.
    Published Sylwan Journal, Volume 160, Issue 4, April 2016, pages 218-244.
    ISSN: 0039-7660
    Editor-in-Chief: B. N. Buszewski.
    Publisher: Sylwan Journal, UL BITWY WARSZAWSKIEJ 1920 R NR 3, WARSZAWA, POLAND, PL-02 362.
    Awarded Excellent evaluation from Sylwan Journal
    Identifiers
    Links http://sylwan.ibles.org/syl/index.php/archive/part/160/4/1/?currentVol=160&currentissue=4
    Citations Nguyen, L. (2016, April 8). New version of CAT algorithm by maximum likelihood estimation. (B. N. Buszewski, Ed.) Sylwan Journal, 160(4), 218-244.
    Cited
    Indexed CABI, PSJC, Thomson Reuters-SCIE
    Metrics JCR 2016: Impact factor = 0.295, Immediacy-Index = 0.12, 5-Y-IF = 0.251, Cited Half-life > 10.0
    Categories Mathematics, Statistics
    Charged Purchase on Sylwan Journal

     

  14. Loc Nguyen (2016, March 28). Theorem of SIGMA-gate Inference in Bayesian Network
    Type Journal Article
    Abstract Bayesian network is a powerful mathematical tool for doing diagnosis and assessment tasks. Parameter learning in Bayesian network is complicated study but I discover that parameter learning becomes easy in some situations. Especially, when Bayesian network is weighted graph and its child node is aggregation of mutually independent parent nodes, there is a simple way to specify conditional probability tables which are parameters of Bayesian network. In this research, I propose and prove the theorem of SIGMA-gate inference which is the fundamental of such simple way helping us to transform weighted graph into Bayesian network.
    Keywords: Bayesian network, parameter learning, SIGMA-gate inference.
    Published Wulfenia Journal, Volume 23, Issue 3, pages 280-289. Publication date is March 28, 2016.
    ISSN: 1561-882X
    Editor-in-Chief: Prof. Dr. Vienna S. Franz
    Contact: Wulfenia Journal, LANDESMUSEUM KARNTEN, MUSEUMGASSE 2, KLAGENFURT, AUSTRIA, A-9021.
    Identifiers
    Links http://www.multidisciplinarywulfenia.org/auto/index.php/archive/part/23/3/1/?currentVol=23&currentissue=3
    Citations Nguyen, L. (2016, March 28). Theorem of SIGMA-gate Inference in Bayesian Network. (V. S. Franz, Ed.) Wulfenia Journal, 23(3), 280-289.
    Cited
    Indexed BIOSIS Previews, Thomson Reuters-SCIE
    Metrics JCR 2016 release: Impact factor = 0.267, Eigenfactor = 0.00003
    Categories Mathematics
    Charged Purchase on Wulfenia Journal

     

  15. Loc Nguyen (2016, February). Specifying Prior Probabilities in Bayesian Network by Maximum Likelihood Estimation method
    Type Journal Article
    Abstract Bayesian network provides the solid inference mechanism when convincing the hypothesis by collecting evidences. Bayesian network is instituted of two models such as qualitative model quantitative model. The qualitative model is its structure and the quantitative model is its parameters, namely conditional probability tables (CPT) whose entries are probabilities quantifying the dependences among variables in network. The quality of CPT depends on the initialized values of its entries. Such initial values are prior probabilities. Because the beta function provides some conveniences when specifying CPT (s), this function is used as the basic distribution in my method. The main problem of defining prior probabilities is how to estimate parameters in beta distribution. It is slightly unfortunate when the equations whose solutions are parameter estimators are differential equations and it is too difficult to solve them. By applying the maximum likelihood estimation (MLE) technique, I invent the simple equations so that differential equations are eliminated and it is much easier to estimate parameters in case that such parameters are positive integer numbers. Thus, I also propose the algorithm to find out the approximate solutions of these simple equations.
    Keywords: prior probabilities, Bayesian network, maximum likelihood estimation.
    Published Sylwan Journal, Volume 160, Issue 2, February 2016, pages 281-298.
    ISSN: 0039-7660
    Editor-in-Chief: B. N. Buszewski.
    Contact: Sylwan Journal, UL BITWY WARSZAWSKIEJ 1920 R NR 3, WARSZAWA, POLAND, PL-02 362.
    Awarded Good evaluation from Sylwan Journal
    Identifiers
    Links http://sylwan.ibles.org/syl/index.php/archive/part/160/2/2/?currentVol=160&currentissue=2
    Citations Nguyen, L. (2016, February). Specifying Prior Probabilities in Bayesian Network by Maximum Likelihood Estimation method. (B. N. Buszewski, Ed.) Sylwan Journal, 160(2), 281-298.
    Cited
    Indexed CABI, PSJC, Thomson Reuters-SCIE
    Metrics JCR 2016: Impact factor = 0.295, Immediacy-Index = 0.12, 5-Y-IF = 0.251, Cited Half-life > 10.0
    Categories Mathematics
    Charged Purchase on Sylwan Journal

     

  16. Loc Nguyen, Thu-Hang T. Ho (2015, November 23). A proposed method for choice of sample size without pre-defining error
    Type Journal Article
    Abstract Sample size is very important in statistical research because it is not too small or too large. Given significant level α, the sample size is calculated based on the z-value and pre-defined error. Such error is defined based on the previous experiment or other study or it can be determined subjectively by specialist, which may cause incorrect estimation. Therefore, this research proposes an objective method to estimate the sample size without pre-defining the error. Given an available sample X = {X1, X2,..., Xn}, the error is calculated via the iterative process in which sample X is re-sampled many times. Moreover, after the sample size is estimated completely, it can be used to collect a new sample in order to estimate new sample size and so on.
    Keywords: sample size, choice of sample size, pre-defined error.
    Published Journal of Data Analysis and Information Processing (JDAIP), Vol.3 No.4, November 2015, pages 163-167.
    ISSN online: 2327-7203, ISSN print: 2327-7211, Open Access.
    Editor-in-Chief: Feng Shi.
    Publisher: Scientific Research Publishing (SCIRP).
    Identifiers DOI: 10.4236/jdaip.2015.34016
    Links http://www.scirp.org/Journal/PaperInformation.aspx?PaperID=61363
    Citations Nguyen, L., & Ho, H. (2015, November 23). A proposed method for choice of sample size without pre-defining error. (F. Shi, Ed.) Journal of Data Analysis and Information Processing (JDAIP), 3(4), 163-167. doi:10.4236/jdaip.2015.34016
    Cited
    Indexed Academic Keys, ARDI, Blyun, CALIS, CNKI Scholar, CNPLINKER, CrossRef, EBSCO, EZB, Google Scholar, i-Scholar, Open Access Library, Open J-Gate, PBN, Research Bible, SciLit, SHERPA, WorldCat, ZDB.
    Metrics The 2-year Google-based Journal Impact Factor 2-GJIF (October 2015): 1
    SCIRP views for the paper (November 2015): 60
    SCIRP downloads for the paper (November 2015): 43
    Categories Statistics

     

  17. Loc Nguyen (2015, November 13). A New Approach for Collaborative Filtering based on Bayesian Network Inference
    Type Conference Paper
    Abstract Collaborative filtering (CF) is one of the most popular algorithms, for recommendation in cases, the items which are recommended to users, have been determined by relying on the outcomes done on surveying their communities. There are two main CF-approaches, which are memory-based and model-based. The model-based approach is more dominant by real-time response when it takes advantage of inference mechanism in recommendation task. However the problem of incomplete data is still an open research and the inference engine is being improved more and more so as to gain high accuracy and high speed. I propose a new model-based CF based on applying Bayesian network (BN) into reference engine with assertion that BN is an optimal inference model because BN is user’s purchase pattern and Bayesian inference is evidence-based inferring mechanism which is appropriate to rating database. Because the quality of BN relies on the completion of training data, it gets low if training data have a lot of missing values. So I also suggest an average technique to fill in missing values.
    Keywords: Collaborative Filtering, Bayesian Network.
    Published The 7th International Conference on Knowledge Discovery and Information Retrieval (KDIR 2015), the part of The 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K 2015) in conjunction with The 7th International Joint Conference on Computational Intelligence.
    Published in Proceedings of The 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR (IC3K-2015), pages 475-480.
    Editors: Ana Fred, Jan Dietz, David Aveiro, Kecheng Liu, Joaquim Filipe.
    Publisher: SCITEPRESS - Science and Technology Publications, Lda.
    Place and date: Lisbon Marriott Hotel, Lisbon, Portugal, November 12-14, 2015.
    Identifiers ISBN: 978-989-758-158-8
    DOI: 10.5220/0005635204750480
    Links
    Citations Nguyen, L. (2015, November 13). A New Approach for Collaborative Filtering based on Bayesian Network Inference. The 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management. 1: KDIR (IC3K-2015), pp. 475-480. Lisbon, Portugal: SCITEPRESS - Science and Technology Publications, Lda. doi:10.5220/0005635204750480
    Cited
    Indexed DPLB, ELSEVIER, IET Inspec, SCITEPRESS Digital Library, Scopus, Thomson Reuters - CPCI
    Metrics
    Categories Computer Science
    Charged

     

  18. Loc Nguyen (2015, October 9). An Advanced Approach of Local Counter Synchronization in Timestamp Ordering Algorithm in Distributed Concurrency Control
    Type Journal Article
    Abstract Concurrency control is the problem that database management system (DBMS) meets with difficulties, especially distributed DBMS. There are two main methods of concurrency control such as locking-based and timestamp-based. Each method gets involved in its own disadvantages, but locking-based approach is often realized in most distributed DBMS because its feasibility and strictness lessen danger in distributed environment. Otherwise, timestamp ordering algorithm is merely implemented in central DBMS due to the issue of local counter synchronization among sites in distributed environment. The common solution is broadcasting the message about the change of local counter (at one site) over distributed network so that all remaining sites “know” to update their own counters. However, this solution raises some disadvantages of low performance. So, an advanced approach is proposed to overcome such disadvantages by giving out another measure so-called active number that is responsible for harmonizing local counters among distributed sites. Moreover, another method is proposed to apply minimum spanning tree into reduce cost of broadcasting messages over distributed network.
    Keywords: distributed concurrency control, timestamp ordering algorithm, local counter synchronization.
    Published Open Access Library Journal (OALib Journal), volume 2, issue 10, pages 1-5.
    ISSN online: 2333-9705, ISSN print: 2333-9721, Open Access.
    Editor: Nigel John.
    Publisher: Open Access Library Inc.
    Identifiers DOI: 10.4236/oalib.1100982
    Links http://www.oalib.com/articles/3113738
    Citations Nguyen, L. (2015, October 9). An Advanced Approach of Local Counter Synchronization in Timestamp Ordering Algorithm in Distributed Concurrency Control. (N. John, Ed.) Open Access Library Journal (OALib Journal), 2(10), 1-5. doi:10.4236/oalib.1100982
    Cited Google Scholar Cited by (November, 2017): 3, 2, 1.
    Indexed Academic Keys, CiteFactor, CNPLINKER, CrossRef, Directory of Science, DTU Findit, EBSCO, EZB, Open J-Gate, Open Access Library, Research Bible, SHERPA, WorldCat, ZDB
    Metrics
    Categories Computer Science

     

  19. Loc Nguyen (2015, September 28). Introduction to A Framework of E-commercial Recommendation Algorithms
    Type Journal Article
    Abstract Recommendation algorithm is very important for e-commercial websites when it can recommend online customers favorite products, which results out an increase in sale revenue. I propose the framework of e-commercial recommendation algorithms. This is a middleware framework or “operating system” for e-commercial recommendation software, which support scientists and software developers build up their own recommendation algorithms based on this framework with low cost, high achievement and fast speed.
    Keywords: Recommendation Algorithm, Recommendation Server, Middleware Framework.
    Published American Journal of Computer Science and Information Engineering (AJCSIE), Vol. 2, No. 4, September 2015, pages 33-44.
    ISSN online: 2381-1129, ISSN print: 2381-1110, Open Access.
    Editors: Abd el rahman Shabayek and more.
    Publisher: American Association for Science and Technology (AASCIT).
    Presented European Project Space, a part of The 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K 2015).
    Place and date: Lisbon Marriott Hotel, Lisbon, Portugal, November 12-14, 2015.
    Identifiers
    Links http://www.aascit.org/journal/archive2?journalId=912&paperId=1894
    Citations Nguyen, L. (2015, September 28). Introduction to A Framework of E-commercial Recommendation Algorithms. (A. e. Shabayek et al., Eds.) American Journal of Computer Science and Information Engineering (AJCSIE), 2(4), 33-44. Retrieved from http://www.aascit.org/journal/archive2?journalId=912&paperId=1894.
    Cited Google Scholar Cited by (January, 2017): 1.
    Indexed
    Metrics
    Categories Computer Science

     

  20. Loc Nguyen, Thu-Hang T. Ho (2015, January 12). A fast computational formula for Kappa coefficient
    Type Journal Article
    Abstract Kappa coefficient is very important in clinical research when there is a requirement of inter-agreement among physicians who measure clinical data. It is too complicated to calculate traditional Kappa formula in huge data because of many arithmetic operations for determining probability of observed agreement and probability of chance agreement. Therefore, this research proposes a fast computational formula for Kappa coefficient based on comments about probability of observed agreement and probability of chance agreement. These comments lead to the method to save time cost when calculating Kappa coefficient and to reduce the number of arithmetic operations at least. Finally, such fast formula is applied into the gestational data measured in real world so as to evaluate its strong point.
    Keywords: Kappa Coefficient, Fast Computational Formula.
    Published Science Journal of Clinical Medicine (SJCM), Vol. 4, No. 1, January 2015, pages 1-3.
    ISSN online: 2327-2732, ISSN print: 2327-2724, Open Access.
    Editors: Arzu Genc, Shao-An Xue, Richard Rison, Vania Rocha.
    Publisher: Science Publishing Group.
    Awarded Certified by Science Publishing Group
    Identifiers DOI: 10.11648/j.sjcm.20150401.11
    Links http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=159&doi=10.11648/j.sjcm.20150401.11
    http://article.sciencepublishinggroup.com/pdf/10.11648.j.sjcm.20150401.11.pdf
    Citations Nguyen, L., & Ho, H. (2015, January 12). A fast computational formula for Kappa coefficient. (A. Genc, S.-A. Xue, R. Rison, & V. Rocha, Eds.) Science Journal of Clinical Medicine (SJCM), 4 (1), 1-3. doi:10.11648/j.sjcm.20150401.11
    Cited ResearchGate Cited by (April, 2017): 1.
    Indexed Academic Keys, ARDI, CNKI, CrossRef, DRJI, EZB, Journal Seek, PBN, Research Bible, WorldCat, WZB, ZDB
    Metrics SciencePG views for the article (October 2015): 214
    SciencePG downloads for the article (October 2015): 132
    Categories Statistics, Medicine

     

  21. Loc Nguyen (2015, January 10). Feasible length of Taylor polynomial on given interval and application to find the number of roots of equation
    Type Journal Article
    Abstract It is very necessary to represent arbitrary function as a polynomial in many situations because polynomial has many valuable properties. Fortunately, any analytic function can be approximated by Taylor polynomial. The higher the degree of Taylor polynomial is, the better the approximation is gained. There is problem that how to achieve optimal approximation with restriction that the degree is not so high because of computation cost. This research proposes a method to estimate feasible degree of Taylor polynomial so that it is likely that Taylor polynomial with degree being equal to or larger than such feasible degree is good approximation of a function in given interval. The feasible degree is called the feasible length of Taylor polynomial. The research also introduces an application that combines Sturm theorem and the method to approximate a function by Taylor polynomial with feasible length in order to count the number of roots of equation in given interval.
    Keywords: Taylor polynomial, roots of equation, analytic function approximation, feasible length.
    Published International Journal of Mathematical Analysis and Applications, Vol. 1, No. 5, December 2014, pages 80-83.
    ISSN: 2375-3927.
    Editors: Abbas Moustafa and more.
    Publisher: American Association for Science and Technology (AASCIT).
    Identifiers
    Links http://www.aascit.org/journal/archive2?journalId=921&paperId=1017
    Citations Nguyen, L. (2015, January 10). Feasible length of Taylor polynomial on given interval and application to find the number of roots of equation. (A. Moustafa et al., Eds.) International Journal of Mathematical Analysis and Applications, 1 (5), 80-83. Retrieved from http://www.aascit.org/journal/archive2?journalId=921&paperId=1017
    Cited
    Indexed Academic Keys, DRJI, Research Bible
    Metrics AASCIT views for the article (October 2015): 215
    AASCIT downloads for the article (October 2015): 54
    Categories Mathematics

     

  22. Loc Nguyen (2014, December 6). Evaluating Adaptive Learning Model
    Type Conference Paper
    Abstract Distance learning or e-learning is a trend of modern education, which brings new chance of study to everyone. Thus, everyone can study at anywhere and anytime so that they can improve and update their knowledge in lifelong time. Adaptive learning is a research branch of e-learning, which give adaptation and personalization to users in learning context. Different people receive different learning materials / teaching methods in accordance with their individual information / characteristics such as knowledge, goal, experience, interest, background, etc. Such individual information is structured in a format so-called user model. User model is the heart of adaptive learning system. User model is managed by user modeling system. There are many theories and practical methods to build up user model and adaptive learning system and each method has particular aspects but it is very difficult to determine which method or system is good because there is no evaluation standard and each method has particular strong point and drawbacks. Therefore, the goal of this research is to propose criterions to evaluate adaptive learning system and user modeling system. Moreover, research gives an evaluation scenario considered as an example for applying proposed criterion into evaluating adaptive learning system and user modeling in learning context.
    Keywords: adaptive learning, user modeling, evaluation.
    Published The 17th International Conference on Interactive Computer aided Learning (ICL2014), which is a part of The 2014 World Engineering Education Forum, Engineering Education For A Global Community.
    Published in Interactive Collaborative Learning (ICL), 2014 International Conference on, pages 818-822.
    Publisher: IEEE
    Place and date: Dubai International Convention and Exhibition Centre, Dubai, UAE, December 3-6, 2014.
    Identifiers DOI: 10.1109/ICL.2014.7017878
    INSPEC Accession Number: 14869356
    Links http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7017878
    Citations Nguyen, L. (2014, December 6). Evaluating Adaptive Learning Model. Interactive Collaborative Learning (ICL), 2014 International Conference on (pp. 818-822). Dubai, UAE: IEEE. doi:10.1109/ICL.2014.7017878
    Cited
    Indexed IEEE Digital Library
    Metrics IEEE Digital Library usage (October 2015): 51
    Categories Computer Science, Education, Statistics
    Charged Purchase on IEEE Digital Library

     

  23. Loc Nguyen (2014, October 21). Improving analytic function approximation by minimizing square error of Taylor polynomial
    Type Journal Article
    Abstract It is very necessary to represent arbitrary function as a polynomial in many situations because polynomial has many valuable properties. Fortunately, any analytic function can be approximated by Taylor polynomial. The quality of Taylor approximation within given interval is dependent on degree of Taylor polynomial and the width of such interval. Taylor polynomial gains highly precise approximation at the point where the polynomial is expanded and so, the farer from such point it is, the worse the approximation is. Given two successive Taylor polynomials which are approximations of the same analytic function in given interval, this research proposes a method to improve the later one by minimizing their deviation so-called square error. Based on such method, the research also propose a so-called shifting algorithm which results out optimal approximated Taylor polynomial in given interval by dividing such interval into sub-intervals and shifting along with sequence of these sub-intervals in order to improve Taylor polynomials in successive process, based on minimizing square error.
    Keywords: Taylor polynomial, analytic function approximation, square error.
    Published International Journal of Mathematical Analysis and Applications, Vol. 1, No. 4, October 2014, pages 63-67.
    ISSN: 2375-3927
    Editors: Abbas Moustafa and more.
    Publisher: American Association for Science and Technology (AASCIT).
    Identifiers
    Links http://www.aascit.org/journal/archive2?journalId=921&paperId=1016
    Citations Nguyen, L. (2014, October 21). Improving analytic function approximation by minimizing square error of Taylor polynomial. (A. Moustafa et al., Eds.) International Journal of Mathematical Analysis and Applications, 1 (4), 63-67. Retrieved from http://www.aascit.org/journal/archive2?journalId=921&paperId=1016
    Cited
    Indexed Academic Keys, DRJI, Research Bible
    Metrics AASCIT views for the article (October 2015): 184
    AASCIT downloads for the article (October 2015): 53
    Categories Mathematics

     

  24. Loc Nguyen (2014, September). Theorem of logarithm expectation and its application to prove sample correlation coefficient as unbiased estimate
    Type Journal Article
    Abstract In statistical theory, a statistic that is function of sample observations is used to estimate distribution parameter. This statistic is called unbiased estimate if its expectation is equal to theoretical parameter. Proving whether or not a statistic is unbiased estimate is very important but this proof may require a lot of efforts when statistic is complicated function. Therefore, this research facilitates this proof by proposing a theorem which states that the expectation of variable x > 0 is μ if and only if the limit of logarithm expectation of x approaches logarithm of μ. In order to make clear of this theorem, the research gives an example of proving correlation coefficient as unbiased estimate by taking advantages of this theorem.
    Keywords: logarithm expectation, correlation coefficient, unbiased estimate.
    Published Journal of Mathematics and System Science, Volume 4, Number 9, September 2014, pages 605-608.
    ISSN online: 2159-5305, ISSN print: 2159-5291, Open Access.
    Editors: Assia Guezane-Lakoud, William P. Fox, Elisa Francomano, Sergo A. Episkoposian, Elizbar Nadaraya, Alexander Nikolaevich Raikov, Baha ŞEN, Claudio Cuevas, Wattanavadee Sriwattanapongse, Mohammad Mehdi Rashidi.
    Publisher: David Publishing Company.
    Identifiers DOI: 10.17265/2159-5291/2014.09.003
    Links http://www.davidpublisher.org/index.php/Home/Article/index?id=505.html
    Citations Nguyen, L. (2014, September). Theorem of logarithm expectation and its application to prove sample correlation coefficient as unbiased estimate. (A. Guezane-Lakoud, W. P. Fox, E. Francomano, S. A. Episkoposian, E. Nadaraya, A. N. Raikov, et al., Eds.) Journal of Mathematics and System Science, 4 (9), 605-608. doi:10.17265/2159-5291/2014.09.003
    Cited
    Indexed Academic Keys, BASE, CEPS, CQVIP, CSTJ, CiteFactor, CSA, DBH, EBSCO, EZB, getCITED, Google Scholar, Index Copernicus, InfoBase Index, InnoSpace, NSD, OCLC, Open J-Gate, PAIS, PBN, ProQuest, Scholar Steer, SHERPA, SIS, SJournal Index, Summon Serials Solutions, Turkish Education Index, UCSD, UDL, UlrichsWeb, WZB
    Metrics
    Categories Statistics, Mathematics

     

  25. Loc Nguyen (2014, May). A New Algorithm for Modeling and Inferring User’s Knowledge by Using Dynamic Bayesian Network
    Type Journal Article
    Abstract Dynamic Bayesian network (DBN) is more robust than normal Bayesian network (BN) for modeling users’ knowledge when it allows monitoring user’s process of gaining knowledge and evaluating her/his knowledge. However the size of DBN becomes numerous when the process continues for a long time; thus, performing probabilistic inference will be inefficient. Moreover the number of transition dependencies among points in time is too large to compute posterior marginal probabilities when doing inference in DBN.
    To overcome these difficulties, I propose the new algorithm that both the size of DBN and the number of Conditional Probability Tables (CPT) in DBN are kept intact (not changed) when the process continues for a long time. This method includes six steps: initializing DBN, specifying transition weights, re-constructing DBN, normalizing weights of dependencies, re-defining CPT(s) and probabilistic inference. Our algorithm also solves the problem of temporary slip and lucky guess: “learner does (doesn’t) know a particular subject but there is solid evidence convincing that she/he doesn’t (does) understand it; this evidence just reflects a temporary slip (or lucky guess)”.
    Keywords: Dynamic Bayesian Network.
    Published Statistics Research Letters (SRL), Volume 3 Issue 2, May 2014.
    ISSN online: 2325-7059, ISSN print: 2325-7040, Open Access.
    Editor: Mohammad Z. Raqab.
    Publisher: Science and Engineering Publishing Company.
    Identifiers
    Links http://www.srl-journal.org/paperInfo.aspx?ID=6933
    http://www.srl-journal.org/Download.aspx?ID=6933
    Citations Nguyen, L. (2014, May). A New Algorithm for Modeling and Inferring User’s Knowledge by Using Dynamic Bayesian Network. (M. Z. Raqab, Ed.) Statistics Research Letters (SRL), 3 (2). Retrieved from http://www.srl-journal.org/paperInfo.aspx?ID=6933
    Cited
    Indexed Academia.edu, Academic Keys, Aol., CiteFactor, Cloud Database, CNKI, CNPLINKER, CrossRef, DataHub, DeepDyve, dogpile, DRJI, EZB, getCITED, GitHub, Internet Archive, JournalTOCs, J-Gate, PubZone, Research Bible, Rice St, Scribd, SIS, UlrichsWeb, Universal Impact Factor, WIPO, WorldCat, Yandex
    Metrics SRL downloads for the article (October 2015): 253
    Categories Computer Science, Mathematics

     

  26. Loc Nguyen (2014, May 28). User Model Clustering
    Type Journal Article
    Abstract User model which is the representation of information about user is the heart of adaptive systems. It helps adaptive systems to perform adaptation tasks. There are two kinds of adaptations:
    • Individual adaptation regards to each user
    • Group adaptation focuses on group of users
    The basic problem needs solving so as to support group adaptation is how to create user groups. This relates to clustering techniques so as to cluster user models because a group is considered as a cluster of similar user models. In this paper I discuss two clustering algorithms: k-means and k-medoids and also propose dissimilarity measures and similarity measures which are applied into different structures (forms) of user models like vector, overlay, and Bayesian network.
    Keywords: User Model, Cluster.
    Published Journal of Data Analysis and Information Processing (JDAIP), Vol. 2, No 2, May 2014, pages 41-48.
    ISSN online: 2327-7203, ISSN print: 2327-7211, Open Access.
    Editor-in-Chief: Feng Shi.
    Publisher: Scientific Research Publishing (SCIRP).
    Identifiers DOI: 10.4236/jdaip.2014.22006
    Links http://www.scirp.org/journal/PaperInformation.aspx?PaperID=46376
    http://www.scirp.org/journal/PaperDownload.aspx?paperID=46376
    Citations Nguyen, L. (2014, May 28). User Model Clustering. (F. Shi, Ed.) Journal of Data Analysis and Information Processing (JDAIP), 2 (2), 41-48. doi:10.4236/jdaip.2014.22006
    Cited
    Indexed Academic Keys, ARDI, Blyun, CALIS, CNKI Scholar, CNPLINKER, CrossRef, EBSCO, EZB, Google Scholar, i-Scholar, Open Access Library, Open J-Gate, PBN, Research Bible, SciLit, SHERPA, WorldCat, ZDB.
    Cited Google Scholar Cited by (October, 2015): 1
    Metrics SCIRP views for the paper (October 2015): 1646
    SCIRP downloads for the paper (October 2015): 856
    The 2-year Google-based Journal Impact Factor 2-GJIF (October 2015): 1
    Categories Computer Science

     

  27. Loc Nguyen (2014, April). A User Modeling System for Adaptive Learning
    Type Dissertation
    Abstract Nowadays modern society requires every citizen always updates and improves her / his knowledge and skills necessary to working and researching. E-learning or distance learning gives everyone a chance to study at anytime and anywhere with full support of computer technology and network. Adaptive learning, a variant of e-learning, aims to satisfy the demand of personalization in learning. The adaptive learning system (ALS) is defined as the computer system that has ability to change its action to provide learning content and pedagogic environment/method for every student in accordance with her/his individual characteristics. Therefore, the ultimate goal of this research is to give the best support to learners in their learning path and this is an enthusiastic contribution to research community. Learners’ information and characteristics such as knowledge, goal, experience, interest, background, etc are the most important to adaptive system. These characteristics are organized in structure so-called learner model (or user model) and the system or computer software that builds up and manipulates learner model is called user modeling system (or learner modeling system). This research proposes a learner model that consists of three essential kinds of information about learners such as knowledge, learning style and learning history. Such three characteristics form a triangle and so this learner model is called Triangular Learner Model (TLM). The ideology of TLM is that user characteristics are various and only some information is really necessary to adaptive learning and an optimal user modeling system should choose essential information relating to user’s study to build up learner model.
    Keywords: User Modeling System, E-learning, Triangular Learner Model.
    Published Standard Scientific Research and Essays (SSRE), Volume 2, Issue 4, April 2014, pages 65-209.
    ISSN online: 2310-7502, ISSN print: 2310-7502, Open Access.
    Editor: Mohammad Asaduzzaman Chowdhury.
    Publisher: Standard Research Journals.
    Presented The research is presented at The 2014 World Engineering Education Forum (WEEF2014), Dubai, UAE, December 2014.

    The research is presented secondly at Athabasca University, Canada, October 2013.

    The research is also presented at Doctoral Consortium of The 3rd International Conference on Theories and Applications of Computer Science (ICTACS2010), Can Tho University, Vietnam, September 26, 2010 and Doctoral Consortium of The 4th Conference on Information Technology and Telecommunications (ICTFIT2012), Ho Chi Minh University of Science, Vietnam.

    The research is presented firstly at Athabasca University, Canada, November 2009.
    Awarded Excellent paper by Standard Research Journals
    Identifiers
    Links http://standresjournals.org/journals/SSRE/Abstract/2014/april/Loc.html
    http://standresjournals.org/journals/SSRE/Pdf/2014/april/Loc%20pdf.pdf
    Citations Nguyen, L. (2014, April). A User Modeling System for Adaptive Learning. University of Science, Ho Chi Minh city, Vietnam. Abuja, Nigeria: Standard Research Journals. Retrieved from http://standresjournals.org/journals/SSRE/Abstract/2014/april/Loc.html
    Cited Google Scholar Cited by (April, 2017): 1.
    Indexed Academic Search Alumni Edition, Academic Search Complete, AGORA, ASFA, ASI, CiteFactor, CNKI Scholar, DOAJ, DRJI, EBSCO, EFITA, Expended Academy Index, General Impact Factor, GEOBASE, GeoRef, Google Scholar, InnoSpace, International Scientific Indexing, Journal Informatics, OAJI, Open J-Gate, Meteorological & Geoastrophysical Abstracts, OARE, ProQuest, Research Bible, TU Berlin, Universal Impact Factor, WZB
    Metrics Universal Impact Factor (October 2015): 1.2363
    Categories Computer Science, Education

     

  28. Loc Nguyen, Thu-Hang T. Ho (2014, March 30). A framework of fetal age and weight estimation
    Type Journal Article
    Abstract Fetal age and weight estimation plays the important role in pregnant treatments. There are many estimate formulas created by the combination of statistics and obstetrics. However, such formulas give optimal estimation if and only if they are applied into specified community or ethnic group with characteristics of such ethnic group. This paper proposes a framework that supports scientists to discover and create new formulas more appropriate to community or region where scientists do their research. The discovery algorithm used inside the framework is the core of the architecture of framework. This algorithm is based on heuristic assumptions, which aims to produce good estimate formula as fast as possible. Moreover, the framework gives facilities to scientists for exploiting useful information under pregnant statistical data.
    Keywords: fetal age estimation, fetal weight estimation, regression model, estimate formula, estimate framework.
    Published Journal of Gynecology and Obstetrics (JGO), Vol. 2, No. 2, 2014, pages 20-25.
    ISSN online: 2376-7820, ISSN print: 2376-7812, Open Access.
    Editors: B Suresh Kumar Shetty, Jose Morales, amany badawy, Chishimba Mowa, Kamla Kant Shukla, Tiane Chen, Sibel Cevizci, Georgios Androutsopoulos.
    Publisher: Science Publishing Group.
    Abstracted The 4th International Conference on Medical Informatics and Telehealth.
    DOI: 10.4172/2157-7420.C1.012
    Publisher: OMICS International.
    Place and date: London, UK, October 6-7, 2016. Website: http://medicalinformatics.conferenceseries.com/2016
    Presented The research is represented and awarded at Ho Chi Minh City Society for Reproductive Medicine (HOSREM).
    Chief Examiner: Prof. Nguyen, Ngoc-Phuong T.
    Place and date: Equatorial Hotel, Ho Chi Minh city, Vietnam, November 26, 2016.
    Awarded Certified by Science Publishing Group
    Identifiers DOI: 10.11648/j.jgo.20140202.13
    Links http://www.sciencepublishinggroup.com/journal/paperinfo.aspx?journalid=255&doi=10.11648/j.jgo.20140202.13
    http://article.sciencepublishinggroup.com/pdf/10.11648.j.jgo.20140202.13.pdf
    Citations Nguyen, L., & Ho, H. (2014, March 30). A framework of fetal age and weight estimation. (B. S. Shetty, J. Morales, a. badawy, C. Mowa, K. K. Shukla, T. Chen, et al., Eds.) Journal of Gynecology and Obstetrics (JGO), 2 (2), 20-25. doi:10.11648/j.jgo.20140202.13
    Cited
    Indexed Academic Keys, CNKI Scholar, CrossRef, DRJI, EZB, PBN, Research Bible, WorldCat, WZB, ZDB
    Metrics SciencePG views for the paper (October 2015): 318
    SciencePG downloads for the paper (October 2015): 49
    Categories Statistics, Medicine, Computer Science

     

  29. Loc Nguyen (2013). A New Approach for Modeling and Discovering Learning Styles by Using Hidden Markov Model
    Type Journal Article
    Abstract Adaptive learning systems are developed rapidly in recent years and the “heart” of such systems is user model. User model is the representation of information about an individual that is essential for an adaptive system to provide the adaptation effect, i.e., to behave differently for different users. There are some main features in user model such as: knowledge, goals, learning styles, interests, background... but knowledge, learning styles and goals are features attracting researchers’ attention in adaptive e-learning domain. Learning styles were surveyed in psychological theories but it is slightly difficult to model them in the domain of computer science because learning styles are too unobvious to represent them and there is no solid inference mechanism for discovering users’ learning styles now. Moreover, researchers in domain of computer science will get confused by so many psychological theories about learning style when choosing which theory is appropriate to adaptive system.
    In this paper I give the overview of learning styles for answering the question “what are learning styles?” and then propose the new approach to model and discover students’ learning styles by using Hidden Markov model (HMM). HMM is such a powerful statistical tool that it allows us to predict users’ learning styles from observed evidences about them.
    Published Global Journal of Human Social Science: G - Linguistics & Education, Volume 13, Issue 4 Version 1.0 Year 2013, pages 1-10.
    Type: Double Blind Peer Reviewed International Research Journal.
    ISSN online: 2249-460X, ISSN print: 0975-587X. Open Access.
    Editor: George Perry and more.
    Publisher: Global Journals Inc. (U.S.).
    Awarded Certified by Global Journal of Human Social Science
    Identifiers FOR Code: 130304
    Links http://socialscienceresearch.org/index.php/GJHSS/article/view/609
    http://socialscienceresearch.org/index.php/GJHSS/article/download/609/556
    Citations Nguyen, L. (2013). A New Approach for Modeling and Discovering Learning Styles by Using Hidden Markov Model. (G. Perry et al., Eds.) Global Journal of Human Social Science: G - Linguistics & Education, 13 (4 Version 1.0 Year 2013), 1-10. Retrieved from http://socialscienceresearch.org/index.php/GJHSS/article/view/609
    Cited Google Scholar Cited by (November, 2016): 3, 2, 1
    Indexed ABCentral, BASE, Cabell’s Directories, Docstoc, Google Scholar, Journal Seek, Open J-Gate, Pennsylvania Digital Library, ProQuest, Scribd, UlrichsWeb
    Metrics Google Scholar citation (2014): h5-index = 4, h5-median = 6
    Categories Computer Science, Education, Psychology, Mathematics

     

  30. Loc Nguyen (2013, July 15). Overview of Bayesian Network
    Type Report
    Abstract Bayesian network is applied widely in machine learning, data mining, diagnosis, etc; it has a solid evidence-based inference which is familiar to human intuition. However Bayesian network causes a little confusion because there are many complicated concepts, formulas and diagrams relating to it. Such concepts should be organized and presented in clear manner so as to be easy to understand it. This is the goal of this report.
    This report includes 4 main parts that cover principles of Bayesian network:
    • Part 1: Introduction to Bayesian network giving some basic concepts.
    • Part 2: Bayesian network inference discussing inference mechanism inside Bayesian network.
    • Part 3: Parameter learning tells us how to update parameters of Bayesian network.
    • Part 4: Structure learning surveys some main techniques to build up Bayesian network.
    Keywords: Bayesian network, parameter learning, structure learning.
    Published Science Journal Of Mathematics and Statistics (SJMS), Volume 2013, July 15, 2013.
    ISSN: 2276-6324, Open Access.
    Publisher: Science Journal Publication.
    Awarded Certified by Science Journal Publication
    Identifiers Article ID: sjms-105
    DOI: 10.7237/sjms/105
    Links http://www.sjpub.org/sjms/abstract/sjms-105.html
    http://www.sjpub.org/sjms/sjms-105.pdf
    Citations Nguyen, L. (2013, July 15). Overview of Bayesian Network. University of Technology, Ho Chi Minh city, Vietnam. Warri, Delta State, Nigeria: Science Journal Publication. doi:10.7237/sjms/105
    Cited
    Indexed CrossRef, Gale, Google Scholar, Summon Serials Solutions, UlrichsWeb
    Metrics
    Categories Mathematics

     

  31. Loc Nguyen (2013, June). The Bayesian approach and suggested stopping criterion in Computerized Adaptive Testing
    Type Journal Article
    Abstract The computer-based tests have more advantages than the traditional paper-based tests when there is the boom of internet and computer. Computer-based testing allows students to perform the tests at any time and any place and the testing environment becomes more realistic. Moreover, it is very easy to assess students’ ability by using the computerized adaptive testing (CAT). The CAT is considered as the branch of computer-based testing but it improves the accuracy of test core when CAT systems try to choose items which are suitable to students’ abilities; such items are called adaptive items.
    The important problem in CAT is how to estimate students’ abilities so as to select the best items for students. There are some methods to solve this problem such as maximization likelihood estimation but we apply the Bayesian approach into computing ability estimates. In this paper, I suggest the stopping criterion for CAT algorithm: the process of testing ends only when student’s knowledge becomes saturated (she/he can’t do test better or worse) and such knowledge is her/his actual knowledge.
    Keywords: Bayesian inference, computerized adaptive test.
    Published International Journal of Research in Engineering and Technology (IJRET), vol. 2, No. 1, 2013, pages 36-38.
    ISSN: 2277-4378
    Editor: Ahmad T. Al-Taani.
    Publisher: Planetary Scientific Research Center.

    International Conference on Computational and Information Sciences (ICCIS’2013). Phuket, Thailand, June 23-24, 2013.
    Identifiers
    Links http://journalsweb.org/siteadmin/upload/74977%20IJRET021007.pdf
    Citations Nguyen, L. (2013, June). The Bayesian approach and suggested stopping criterion in Computerized Adaptive Testing. (A. T. Al-Taani, Ed.) International Journal of Research in Engineering and Technology (IJRET), 2 (1-2103), 36-38. Retrieved from http://journalsweb.org/siteadmin/upload/74977%20IJRET021007.pdf
    Cited
    Indexed Ask.com, Bing, Google Scholar, Yahoo, Yandex
    Metrics Google Scholar citation on ICCIS (2014): h5-index = 11, h5-median = 15
    Categories Computer Science, Mathematics, Education

     

  32. Loc Nguyen, Phung Do, Thanh-Nguyen Vu, Nam-Dung Tran (2013, March 20). A New Approach for Collaborative Filtering Based on Mining Frequent Itemsets
    Type Conference Paper
    Abstract As one of the most successful approaches to building recommender systems, collaborative filtering (CF) uses the known preferences of a group of users to make recommendations or predictions of the unknown preferences for other users. In this paper, we first propose a new CF model-based approach which has been implemented by basing on mining frequent itemsets technique with the assumption that “The larger the support of an item is, the higher it's likely that this item will occur in some frequent itemset, is”. We then present the enhanced techniques such as the followings: bits representations, bits matching as well bits mining in order to speeding-up the algorithm processing with CF method.
    Keywords: collaborative filtering, mining frequent itemsets, bit matching, bit mining.
    Published ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II, Session: Tools and Applications, pages 19-29. Series Title: Lecture Notes in Computer Science.
    ISBN print: 978-3-642-36542-3, ISBN online: 978-3-642-36543-0, Series ISSN: 0302-9743.
    Editors: Ali Selama, Ngoc Thanh Nguyen, Habibollah Haron.
    Publisher: Springer Berlin Heidelberg.
    Place and date: Kuala Lumpur, Malaysia, March 18-20, 2013.
    Full Version Accepted International Journal of Applied Mathematics and Machine Learning. Acceptance date: July 15, 2016
    ISSN: 2394-2258
    Editors: Li Li, Shuaiqi Liu, Mehmet Koc, José Luis López-Bonilla, Balan Sethuramalingam, Bin Guo, Loc Nguyen, Hind Rustum Mohammed Shaaban, Srinivas Nowduri.
    Publisher: Scientific Advances Publishers.
    Identifiers DOI: 10.1007/978-3-642-36543-0_3
    Links http://link.springer.com/chapter/10.1007/978-3-642-36543-0_3
    Citations Nguyen, L., Do, Minh-Phung T., Vu, Nguyen T., & Tran, Dung N. (2013, March 20). A New Approach for Collaborative Filtering Based on Mining Frequent Itemsets. In Selamat, A., Nguyen, Ngoc T., & Haron, H. (Ed.), ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems. II, pp. 19-29. Kuala Lumpur: Springer. doi:10.1007/978-3-642-36543-0_3
    Cited
    Indexed ACM Digital Library, BibSonomy, DBLP, Google Scholar, Research Gate, SpringerLink
    Metrics Springer downloads (2017, January): 1114
    Categories Computer Science

     

  33. Loc Nguyen (2011). The method of seven qigong exercises of archery simulation
    Type Journal Article
    Abstract Archery simulation is the qigong method that simulates archery art but there is no real bow and arrow. The important secrete is that the trainee imagines that she/he uses the virtual bow and arrow to shoot an invisible target incorporated with both her/his breath and strong intention that she/he will shoot accurately to the invisible target.
    Published Nguyen Hoai Van‘s website
    Identifiers
    Links View on Nguyen Hoai Van‘s website
    Download
    Citations Nguyen, L. (2011). The method of seven qigong exercises of archery simulation. (V. H. Nguyen, Ed.) Nguyen Hoai Van‘s website.
    Cited
    Indexed
    Metrics
    Categories Sport

     

  34. Loc Nguyen (2010). Discovering User Interests by Document Classification
    Type Book Chapter
    Abstract User interest is one of personal traits attracting researchers’ attention in user modeling and user profiling. User interest competes with user knowledge to become the most important characteristics in user model. Adaptive systems need to know user interests so that provide adaptation to user. For example, adaptive learning systems tailor learning materials (lesson, example, exercise, test...) to user interests. I propose a new approach for discovering user interest based on document classification. The basic idea is to consider user interests as classes of documents. The process of classifying documents is also the process of discovering user interests. There are two new points of view:
    • The series of user access in his/her history are modeled as documents. So user is referred indirectly to as “document”.
    • User interests are classes such documents are belong to.
    Our approach includes four following steps:
    1. Documents in training corpus are represented according to vector model. Each element of vector is product of term frequency and inverse document frequency. However the inverse document frequency can be removed from each element for convenience.
    2. Classifying training corpus by applying decision tree or support vector machine or neural network. Classification rules (weight vectors W*) are drawn from decision tree (support vector machine). They are used as classifiers.
    3. Mining user’s access history to find maximum frequent itemsets. Each itemset is considered a interesting document and its member items are considered as terms. Such interesting documents are modeled as vectors.
    4. Applying classifiers (see step 3) into these interesting documents in order to choose which classes are most suitable to these interesting documents. Such classes are user interests.
    This approach bases on document classification but it also relates to information retrieval in the manner of representing documents. Hence section 1 discusses about vector model for representing documents. Support vector machine, decision tree and neural network on document classification are mentioned in section 2, 3, 4. Main technique to discover user interest is described in section 5. Section 6 is the evaluation.
    Published In I-Hsien Ting, Hui-Ju Wu, and Tien-Hwa Ho (Eds.), Mining and Analyzing Social Networks (Vol. 288 In series “Studies in Computational Intelligence”), chapter 9, pages 139-159.
    ISBN online: 978-3-642-13422-7, ISBN print: 978-3-642-13421-0, Series ISSN: 1860-949X, DOI: 10.1007/978-3-642-13422-7
    Editors: I-Hsien Ting, Hui-Ju Wu, Tien-Hwa Ho.
    Publisher: Springer.
    Identifiers DOI: 10.1007/978-3-642-13422-7_9
    Links http://link.springer.com/chapter/10.1007/978-3-642-13422-7_9
    Citations Nguyen, L. (2010). Discovering User Interests by Document Classification. In I.-H. Ting, H.-J. Wu, T.-H. Ho, I.-H. Ting, H.-J. Wu, & T.-H. Ho (Eds.), Mining and Analyzing Social Networks (Vol. 288 In series “Studies in Computational Intelligence”, pp. 139-159). Springer Berlin Heidelberg. doi:10.1007/978-3-642-13422-7_9
    Cited
    Indexed BibSonomy, DBLP, Google Books, Google Scholar, Journal Seek (Current Mathematical Publications), MathSciNet and Mathematical Reviews, PubZone, Researchr, Scopus, SpringerLink, UlrichsWeb, WorldCat, Zentralblatt MATH
    Metrics SJR on series “Studies in Computational Intelligence” (2012): sjr-rank = 0.223, h-index = 17.
    IEEE Digital Library readers for the chapter (October 2015): 3
    IEEE Digital Library for the chapter (October 2015): 414
    Categories Computer Science
    Charged Purchase on Springer, Purchase on Amazon, Purchase on Holistic Page, Purchase on BlackWell’s, Purchase on Krisostomus

     

  35. Loc Nguyen (2010). Overview of The System of Acupuncture Spots in Oriental Medicine based on Oriental Philosophy
    Type Document From Web site
    Abstract This presentation introduces Oriental philosophy and system of acupuncture spots in Oriental medicine.
    Published Loc Nguyen's Homepage.
    Place and date: Ho Chi Minh city, Vietnam, 2010.
    Identifiers
    Links https://goo.gl/78K1Pr
    Citations Nguyen, L. (2010). Overview of The System of Acupuncture Spots in Oriental Medicine based on Oriental Philosophy. (L. Nguyen, Ed.) Retrieved from Loc Nguyen's Homepage: https://goo.gl/78K1Pr
    Cited
    Indexed
    Metrics
    Categories Oriental Medicine, Philosophy

     

  36. Loc Nguyen (2009, September 25). Incorporating Bayesian Inference into Adaptation Rules in AHA architecture
    Type Conference Paper
    Abstract Adaptive Hypermedia System (AHS) aims to provide users the adaptation effect based on their characteristics. In other words, AHS ensures that the links that are offered and the content of the information pages are adapted to each individual user. AHA! developed by Debra is an open Adaptive Hypermedia Architecture that is suitable for many different applications; it aims to generic purpose. The architecture of AHA based on Dexter Reference Model has some prominences but the inside user model is built up by overlay method in which the domain is decomposed into a set of elements and the overlay is simply a set of masteries over those elements. Although overlay model is easy to represent user information, there is no inference mechanism for reasoning out new assumptions about user. So I propose a new way to incorporating Bayesian inference into AHA so that it is able to improve modeling functionality in AHA.
    Published Proceedings of 12th International Conference on Interactive Computer aided Learning (ICL2009).
    ISBN: 978-3-89958-481-3
    Publisher: Kassel University Press, Kassel, Germany.
    Place and date: Villach, Austria. September 23-25, 2009.
    Identifiers
    Links http://www.icl-conference.org/dl/proceedings/2009/archive.htm
    Citations Nguyen, L. (2009, September 25). Incorporating Bayesian Inference into Adaptation Rules in AHA architecture. Proceedings of 12th International Conference Interests Interactive Computer aided Learning (ICL2009). Villach, Austria: Kassel University Press, Kassel, Germany. Retrieved from http://www.icl-conference.org/dl/proceedings/2009/archive.htm
    Cited
    Indexed
    Metrics
    Categories Computer Science, Mathematics
    Charged Purchase Proceedings of ICL2009

     

  37. Loc Nguyen (2009, August 31). A Proposal Discovering User Interests by Support Vector Machine and Decision Tree on Document Classification
    Type Conference Paper
    Abstract User interest is one of personal traits attracting researchers’ attention in user modeling and user profiling. User interest competes with user knowledge to become the most important characteristic in user model. Adaptive systems need to know user interests so that provide adaptation to user. For example, adaptive learning systems tailor learning materials (lesson, example, exercise, test,...) to user interests. I propose a new approach for discovering user interest based on document classification. The basic idea is to consider user interests as classes of documents. The process of classifying documents is also the process of discovering user interests. There are two new points of view:
    • The series of user access in his/her history are modeled as documents. So user is referred indirectly to as “document”.
    • User interests are classed such documents are belong to.
    Published The International Workshop on Social Networks Mining and Analysis for Business Applications (SNMABA2009) in conjunction with The 2009 IEEE International Conference on Social Computing (SocialCom). Published in Computational International Conference on Science and Engineering 2009 (CSE ’09), volume 4, pages 809-814.
    ISBN online: 978-0-7695-3823-5, ISBN print: 978-1-4244-5334-4
    Publisher: IEEE
    Place and date: Vancouver, Canada. August 29-31, 2009.
    Identifiers DOI: 10.1109/CSE.2009.112
    INSPEC Accession Number: 10915393
    IEEE Article Number: 5283280
    SNMABA ID: SNMABA09-107
    ACM Citation ID: 1633778
    Links http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5283280
    http://dl.acm.org/citation.cfm?id=1633778
    Citations Nguyen, L. (2009, August 31). A Proposal Discovering User Interests by Support Vector Machine and Decision Tree on Document Classification. The International Workshop on Social Networks Mining and Analysis for Business Applications (SNMABA2009) in conjunction with The 2009 IEEE International Conference on Social Computing (SocialCom), 4, pp. 809-814. Vancouver, Canada: Computational International Conference on Science and Engineering 2009 (CSE ’09), IEEE. doi:10.1109/CSE.2009.112
    Cited Google Scholar Cited by (October, 2016): 5, 4, 3, 2, 1
    Indexed ACM Digital Library, CrossRef, DBLP, DeepDyve, Google Scholar, IEEE Digital Library, Pubget, Scopus
    Metrics Acceptance rate is 9%
    Google Scholar citation on SocialComp (2014): h5-index = 19, h5-median = 23, work-cited = 3
    IEEE Digital Library usage (October 2015): 155
    Categories Computer Science
    Charged Purchase on IEEE Digital Library

     

  38. Loc Nguyen, Phung Do (2009, July 16). Evolution of parameters in Bayesian Overlay Model
    Type Conference Paper
    Abstract Adaptive learning systems require well-organized user model along with solid inference mechanism. Overlay modeling is the method in which the domain is decomposed into a set of elements and the user model is simply a set of masteries over those elements. The combination between overlay model and Bayesian network (BN) will make use of the flexibility and simplification of overlay modeling and the power inference of BN. However, it is compulsory to pre-define parameters, namely, Conditional Probability Tables (CPTs) in Bayesian network but no one ensured absolutely the correctness of these CPTs. This paper discusses about how to enhance parameters’ quality in Bayesian overlay model, in other words, this is the evolution of CPTs.
    Published Proceedings of The 2009 International Conference on Artificial Intelligence (IC-AI’09), pages 324-329. The 2009 World Congress in Computer Science, Computer Engineering, and Applied Computing (WORLDCOMP’09).
    ISBN: 1-60132-107-4, 1-60132-108-2 (1-60132-109-0)
    Editors: Hamid R. Arabnia, David de la Fuente, Jose A. Olivas.
    Publisher: CSREA Press USA.
    Place and date: Monte Carlo Resort, Las Vegas, Nevada, USA, July 13-16, 2009.

    Proceedings of The Second International Conference on Information and Communication Technologies and Accessibility (ICTA 2009), page 257-268.
    ISBN: 978-9973-37-516-2
    Place and date: Hammamet, Tunisia. May 7-9 2009.
    Identifiers
    Links http://www.researchgate.net/publication/220834553_Evolution_of_Parameters_in_Bayesian_Overlay_Model
    Citations Nguyen, L., & Do, P. (2009, July 16). Evolution of parameters in Bayesian Overlay Model. In H. R. Arabnia, D. d. Fuente, & J. A. Olivas (Ed.), Proceedings of The 2009 International Conference on Artificial Intelligence (IC-AI’09), The 2009 World Congress in Computer Science, Computer Engineering, and Applied Computing (WORLDCOMP’09) (pp. 324-329). Monte Carlo Resort, Las Vegas, Nevada, USA: CSREA Press USA. Retrieved from http://www.researchgate.net/publication/220834553_Evolution_of_Parameters_in_Bayesian_Overlay_Model
    Cited
    Indexed AMiner, BibSonomy, DBLP, IET Inspec, PubZone, Research Gate, Researchr, TDG Scholar
    Metrics ICAI’09: Acceptance rate is 27%
    CORE ranking on IC-AI (2013): C
    Google Scholar citation on IC-AI (2014): h5-index = 8, h5-median = 11
    Categories Mathematics, Computer Science

     

  39. Loc Nguyen (2009, July 10). ZEBRA: A new User Modeling System for Triangular Model of Learners’ Characteristics
    Type Conference Paper, Conference Poster
    Type Journal Article
    Abstract The core of adaptive system is the user model that is the representation of information about an individual. User model is necessary for an adaptive system to provide the adaptation effect, i.e., to behave differently for different users. The system that collects user information to build up user model and reasons out new assumptions about user is called user modeling system (UMS). There are two main tendencies towards implementing UMS: domain-independent UMS and domain-dependent UMS. The latter is called generic UMS known widely but our approach focuses on the domain-dependent UMS applied into adaptive e-learning especially. The reason is that domain-independent UMS is too generic to “cover” all learners’ characteristics in e-learning, which may cause unpredictable bad consequences in adaptation process. Note that user is considered as learner in e-learning context. Many users’ characteristics can be modeled but each characteristic is in accordance with respective modeling method. It is impossible to model all learners’ characteristics because of such reason “there is no modeling method fit all characteristics”.
    To overcome these obstacles and difficulties, I propose the new model of learner “Triangular Learner Model (TLM)” composed by three main learners’ characteristics: knowledge, learning style and learning history. TLM with such three underlying characteristics will cover the whole of learner’s information required by learning adaptation process. The UMS which builds up and manipulates TLM is also described in detail and named Zebra. I also propose the new architecture of an adaptive application and the interaction between such application and Zebra.
    Published AIED 2009: 14th conference on Artificial Intelligence in Education, Proceedings of the Workshop on “Enabling creative learning design: how HCI, User Modeling and Human Factors Help”, pages 42-51.
    ISBN online: 978-1-60750-446-7, ISBN print: 978-1-60750-028-5. DOI: 10.3233/978-1-60750-028-5-813
    Editors: George D. Magoulas, Patricia Charlton, Diana Laurillard, Kyparisia Papanikolaou, Maria Grigoriadou.
    Publisher: IOS Press Amsterdam, The Netherlands, The Netherlands.
    Conference place and date: Thistle Hotel, Brighton, UK. July 6-10, 2009.

    Poster at The 11th Human-Centred Technology Postgraduate Workshop at the University of Sussex.
    Place and date: University of Sussex, United Kingdom. July 13, 2009. Website: http://eventseer.net/e/10209
    Identifiers
    Links http://www.dcs.bbk.ac.uk/~gmagoulas/LD_WorkshopsProceedings-web.pdf#page=46
    Citations Nguyen, L. (2009, July 10). ZEBRA: A new User Modeling System for Triangular Model of Learners‘ Characteristics. In G. D. Magoulas, P. Charlton, D. Laurillard, K. Papanikolaou, & M. Grigoriadou (Ed.), AIED 2009: 14th conference on Artificial Intelligence in Education, Proceedings of the Workshop on “Enabling creative learning design: how HCI, User Modeling and Human Factors Help” (pp. 42-51). Brighton, United Kingdom: IOS Press Amsterdam, The Netherlands, The Netherlands. Retrieved from http://www.dcs.bbk.ac.uk/~gmagoulas/LD_WorkshopsProceedings-web.pdf#page=46
    Cited
    Indexed Academia.edu, ACM Digital Library, BibSonomy, BIROn, DBLP, Google scholar, Microsoft Academy Search, Research Gate
    Metrics CORE ranking on AIED (2013): A
    Google Scholar citation on AIED (2014): h5-index = 15, h5-median = 25
    Zaïane (2011): Top Tier Conferences
    Categories Computer Science

     

  40. Loc Nguyen, Phung Do (2009, June 3). Learning Concept Recommendation based on Sequential Pattern Mining
    Type Conference Paper
    Abstract Sequential pattern mining is new trend in data mining domain with many useful applications, especially commercial application but it also results surprised effect in adaptive learning. Suppose there is an adaptive e-learning website, a student access learning material / do exercises relating domain concepts in sessions. His learning sequences which are lists of concepts accessed after total study sessions construct the learning sequence database S. S is mined to find the sequences which are expected to be learned frequently or preferred by student. Such sequences called sequential patterns are use to recommend appropriate concepts / learning objects to students in his next visits. It results in enhancing the quality of adaptive learning system. This process is sequential pattern mining. In paper, I also suppose an approach to break sequential pattern s=<c1, c2,..., cm> into association rules including left-hand and right-hand in form cicj. Left-hand is considered as source concept, right-hand is treated as recommended concept available to students.
    Published Proceedings of The 2009 Third International Digital Ecosystems and Technologies Conference (IEEE-DEST 2009), pages 66-71.
    IEEE Catalog Number: CFP09DES-CDR, ISBN online: 978-1-4244-2346-0, ISBN print: 978-1-4244-2345-3, Library of Congress: 2008902855
    Editors: Elizabeth Chang, Farookh Hussain, and Erdal Kayacan.
    Publisher: IEEE
    Place and date: Harbiye Military Museum and Cultural Center, Istanbul, Turkey, May 31 - June 3, 2009.
    Identifiers DOI: 10.1109/DEST.2009.5276694
    INSPEC Accession Number: 10904985
    IEEE Article Number: 5276694
    Links http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5276694
    Citations Nguyen, L., & Do, P. (2009, June 3). Learning Concept Recommendation based on Sequential Pattern Mining. In E. Chang, F. Hussain, & E. Kayacan (Ed.), Proceedings of The 2009 Third International Digital Ecosystems and Technologies Conference (IEEE-DEST 2009) (pp. 66-71). Istanbul, Turkey: IEEE. doi:10.1109/DEST.2009.5276694
    Cited Google Scholar Cited by (October, 2015): 4, 3, 2, 1
    Indexed CrossRef, IEEE Digital Library, IET Inspec, Google Scholar, Library of Congress, Microsoft Academy Search, Pubget, Scopus, Thomson Reuters- CPCI
    Metrics CORE ranking (2013): C
    Google Scholar citation (2014): h5-index = 13, h5-median = 15, work-cited = 2
    IEEE Digital Library usage (October 2015): 100
    Categories Computer Science
    Charged Purchase on IEEE Digital Library

     

  41. Loc Nguyen, Phung Do (2009). Combination of Bayesian Network and Overlay Model in User Modeling
    Type Conference Paper, Journal Article
    Abstract The core of adaptive system is user model containing personal information such as knowledge, learning styles, and goals which is requisite for learning personalized process. There are many modeling approaches, for example: stereotype, overlay, and plan recognition but they don’t bring out the solid method for reasoning from user model. This paper introduces the statistical method that combines Bayesian network and overlay modeling so that it is able to infer user’s knowledge from evidences collected during user’s learning process.
    Keywords: Bayesian network, overlay model, user model.
    Published Proceedings of 4th International Conference on Interactive Mobile and Computer Aided Learning (IMCL 2009).
    Place and date: Princess Sumaya University for Technology, Amman, Jordan, April 22-24 2009.

    Proceedings of 9th International Conference on Computational Science (ICCS 2009), Lecture Notes in Computer Science (LNCS), Volume 5545, 2009, pages 5-14.
    ISBN-13: 978-3-642-01972-2, ISSN: 0302-9743. Series ISSN: 0302-9743.
    Editors: Gabrielle Allen, Jarosław Nabrzyski, Edward Seidel, Geert Dick van Albada, Jack Dongarra, and Peter M. A. Sloot.
    Publisher: Springer.
    Conference place and date: Baton Rouge, Louisiana, USA. May 25-27, 2009. Website: http://www.iccs-meeting.org/iccs2009

    International Journal of Emerging Technologies in Learning (iJET), Vol. 4, No. 4 (2009), pages 41-45.
    ISSN online: 1863-0383, ISSN print: 1868-8799, Open Access.
    Editor: Michael E. Auer.
    Publisher: International Association of Online Engineering (IAOE).
    Identifiers DOI (ICCS 2009): 10.1007/978-3-642-01973-9_2
    DOI (iJET): 10.3991/ijet.v4i4.684
    ACM Citation ID: 1561116
    Links http://online-journals.org/i-jet/article/view/684
    http://link.springer.com/chapter/10.1007%2F978-3-642-01973-9_2
    Citations Nguyen, L., & Do, P. (2009). Combination of Bayesian Network and Overlay Model in User Modeling. (M. E. Auer, Ed.) International Journal of Emerging Technologies in Learning (iJET), 4 (4), 41-45. doi:10.3991/ijet.v4i4.684
    Cited Google Scholar Cited by (March, 2017): 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5 (Rim, Web Aplication and Cloud Computing), 4, 3, 2, 1
    Indexed ACM Digital Library, AMiner, BibSonomy, Cite Seer X, DBLP, DOAJ, EBSCO, EdITLib, Ei, Google Scholar, Google Book, IET Inspec, Microsoft Academic Search, PubZone, Researchr, Scopus, SpringerLink, Thomson Reuters - ESCI (iJET), UlrichsWeb, WorldWideScience, Zotero
    Metrics SJR on iJET (2012): sjr-rank = 0.169, h-index = 4
    CORE ranking on ICCS (2013): A
    Google Scholar citation on ICCS (2014): h5-index = 18, h5-median = 27, work-cited = 11
    Google Scholar citation on iJET (2014): h5-index = 11, h5-median = 16, work-cited = 10
    Categories Computer Science, Mathematics
    Charged Purchase on Springer

     

Last updated November 2017

Abstracting and indexing

Comments