NotesFAQContact Us
Collection
Advanced
Search Tips
Publication Date
In 20250
Since 20240
Since 2021 (last 5 years)0
Since 2016 (last 10 years)0
Since 2006 (last 20 years)1
Source
International Journal of…4
Education Level
Higher Education1
Audience
Researchers1
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Showing all 4 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Voskoglou, Michael Gr. – International Journal of Mathematical Education in Science and Technology, 2010
We represent the main stages of the process of mathematical modelling as fuzzy sets in the set of the linguistic labels of negligible, low intermediate, high and complete success by students in each of these stages and we use the total possibilistic uncertainty as a measure of students' modelling capacities. A classroom experiment is also…
Descriptors: Mathematical Models, Experiments, Markov Processes, Matrices
Peer reviewed Peer reviewed
Direct linkDirect link
Ching, Wai-Ki; Fung, Eric S.; Ng, Michael K. – International Journal of Mathematical Education in Science and Technology, 2004
Categorical data sequences occur in many applications such as forecasting, data mining and bioinformatics. In this note, we present higher-order Markov chain models for modelling categorical data sequences with an efficient algorithm for solving the model parameters. The algorithm can be implemented easily in a Microsoft EXCEL worksheet. We give a…
Descriptors: Mathematics, Markov Processes
Peer reviewed Peer reviewed
Direct linkDirect link
Ching, Wai-Ki; Ng, Michael K. – International Journal of Mathematical Education in Science and Technology, 2004
Hidden Markov models (HMMs) are widely used in bioinformatics, speech recognition and many other areas. This note presents HMMs via the framework of classical Markov chain models. A simple example is given to illustrate the model. An estimation method for the transition probabilities of the hidden states is also discussed.
Descriptors: Markov Processes, Probability, Mathematical Models, Computation
Peer reviewed Peer reviewed
Chae, K. C.; Lee, H. W. – International Journal of Mathematical Education in Science and Technology, 1997
Considers the random sum SN+X1+X2+...+XN with a stopping rule N=min((n: SN absorbing Markov chain. (AIM)
Descriptors: Algebra, Computation, Equations (Mathematics), Functions (Mathematics)