Artigos de revistas: "Probability learning"

1

SAEKI, Daisuke. "Probability learning in golden hamsters". Japanese Journal of Animal Psychology 49, n.º 1 (1999): 41–47. http://dx.doi.org/10.2502/janip.49.41.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Groth, Randall E., Jennifer A. Bergner e Jathan W. Austin. "Dimensions of Learning Probability Vocabulary". Journal for Research in Mathematics Education 51, n.º 1 (janeiro de 2020): 75–104. http://dx.doi.org/10.5951/jresematheduc.2019.0008.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

Normative discourse about probability requires shared meanings for disciplinary vocabulary. Previous research indicates that students’ meanings for probability vocabulary often differ from those of mathematicians, creating a need to attend to developing students’ use of language. Current standards documents conflict in their recommendations about how this should occur. In the present study, we conducted microgenetic research to examine the vocabulary use of four students before, during, and after lessons from a cycle of design-based research attending to probability vocabulary. In characterizing students’ normative and nonnormative uses of language, we draw implications for the design of curriculum, standards, and further research. Specifically, we illustrate the importance of attending to incrementality, multidimensionality, polysemy, interrelatedness, and heterogeneity to foster students’ probability vocabulary development.

3

Groth, Randall E., Jennifer A. Bergner e Jathan W. Austin. "Dimensions of Learning Probability Vocabulary". Journal for Research in Mathematics Education 51, n.º 1 (janeiro de 2020): 75–104. http://dx.doi.org/10.5951/jresematheduc.51.1.0075.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

Normative discourse about probability requires shared meanings for disciplinary vocabulary. Previous research indicates that students’ meanings for probability vocabulary often differ from those of mathematicians, creating a need to attend to developing students’ use of language. Current standards documents conflict in their recommendations about how this should occur. In the present study, we conducted microgenetic research to examine the vocabulary use of four students before, during, and after lessons from a cycle of design-based research attending to probability vocabulary. In characterizing students’ normative and nonnormative uses of language, we draw implications for the design of curriculum, standards, and further research. Specifically, we illustrate the importance of attending to incrementality, multidimensionality, polysemy, interrelatedness, and heterogeneity to foster students’ probability vocabulary development.

4

Rivas, Javier. "Probability matching and reinforcement learning". Journal of Mathematical Economics 49, n.º 1 (janeiro de 2013): 17–21. http://dx.doi.org/10.1016/j.jmateco.2012.09.004.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

West, Bruce J. "Fractal Probability Measures of Learning". Methods 24, n.º 4 (agosto de 2001): 395–402. http://dx.doi.org/10.1006/meth.2001.1208.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Malley, J. D., J. Kruppa, A. Dasgupta, K. G. Malley e A. Ziegler. "Probability Machines". Methods of Information in Medicine 51, n.º 01 (2012): 74–81. http://dx.doi.org/10.3414/me00-01-0052.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

SummaryBackground: Most machine learning approaches only provide a classification for binary responses. However, probabilities are required for risk estimation using individual patient characteristics. It has been shown recently that every statistical learning machine known to be consistent for a nonparametric regression problem is a probability machine that is provably consistent for this estimation problem.Objectives: The aim of this paper is to show how random forests and nearest neighbors can be used for consistent estimation of individual probabilities.Methods: Two random forest algorithms and two nearest neighbor algorithms are described in detail for estimation of individual probabilities. We discuss the consistency of random forests, nearest neighbors and other learning machines in detail. We conduct a simulation study to illustrate the validity of the methods. We exemplify the algorithms by analyzing two well-known data sets on the diagnosis of appendicitis and the diagnosis of diabetes in Pima Indians.Results: Simulations demonstrate the validity of the method. With the real data application, we show the accuracy and practicality of this approach. We provide sample code from R packages in which the probability estimation is already available. This means that all calculations can be performed using existing software.Conclusions: Random forest algorithms as well as nearest neighbor approaches are valid machine learning methods for estimating individual probabilities for binary responses. Freely available implementations are available in R and may be used for applications.

7

Dawson, Michael R. W. "Probability Learning by Perceptrons and People". Comparative Cognition & Behavior Reviews 15 (2022): 1–188. http://dx.doi.org/10.3819/ccbr.2019.140011.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

HIRASAWA, Kotaro, Masaaki HARADA, Masanao OHBAYASHI, Juuichi MURATA e Jinglu HU. "Probability and Possibility Automaton Learning Network". IEEJ Transactions on Industry Applications 118, n.º 3 (1998): 291–99. http://dx.doi.org/10.1541/ieejias.118.291.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Groth, Randall E., Jaime Butler e Delmar Nelson. "Overcoming challenges in learning probability vocabulary". Teaching Statistics 38, n.º 3 (26 de maio de 2016): 102–7. http://dx.doi.org/10.1111/test.12109.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Starzyk, J. A., e F. Wang. "Dynamic Probability Estimator for Machine Learning". IEEE Transactions on Neural Networks 15, n.º 2 (março de 2004): 298–308. http://dx.doi.org/10.1109/tnn.2004.824254.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Kabata, Takashi, Takemasa Yokoyama, Yasuki Noguchi e Shinichi Kita. "Location Probability Learning Requires Focal Attention". Perception 43, n.º 4 (janeiro de 2014): 344–50. http://dx.doi.org/10.1068/p7589.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Kreitler, Shulamith, e Edward Zigler. "Motivational Determinants of Children's Probability Learning". Journal of Genetic Psychology 151, n.º 3 (setembro de 1990): 301–16. http://dx.doi.org/10.1080/00221325.1990.9914619.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Bialek, William, Curtis G. Callan e Steven P. Strong. "Field Theories for Learning Probability Distributions". Physical Review Letters 77, n.º 23 (2 de dezembro de 1996): 4693–97. http://dx.doi.org/10.1103/physrevlett.77.4693.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Husmeier, D. "Learning non-stationary conditional probability distributions". Neural Networks 13, n.º 3 (abril de 2000): 287–90. http://dx.doi.org/10.1016/s0893-6080(00)00018-6.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Lungu, O. V., T. W�chter, T. Liu, D. T. Willingham e J. Ashe. "Probability detection mechanisms and motor learning". Experimental Brain Research 159, n.º 2 (16 de julho de 2004): 135–50. http://dx.doi.org/10.1007/s00221-004-1945-7.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Tanujaya, Benidiktus, Rully Charitas Indra Prahmana e Jeinne Mumu. "Designing learning activities on conditional probability". Journal of Physics: Conference Series 1088 (setembro de 2018): 012087. http://dx.doi.org/10.1088/1742-6596/1088/1/012087.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Schumacher, Martin. "Probability estimation and machine learning-Editorial". Biometrical Journal 56, n.º 4 (julho de 2014): 531–33. http://dx.doi.org/10.1002/bimj.201400075.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Rahmi, F., P. D. Sampoerno e L. Ambarwati. "Probability learning trajectory: Students’ emerging relational understanding of probability through ratio". Journal of Physics: Conference Series 1470 (fevereiro de 2020): 012067. http://dx.doi.org/10.1088/1742-6596/1470/1/012067.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Shi-Ming Huang, Shi-Ming Huang, Yu-Ting Huang Shi-Ming Huang e Li-Kuan Wang Yu-Ting Huang. "Teaching Case – Predicting the Probability of Company Bankruptcy with CAATs". International Journal of Computer Auditing 2, n.º 1 (dezembro de 2020): 005–22. http://dx.doi.org/10.53106/256299802020120201002.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

<p>The paper provides a machine-learning experimental process for a real-world corporate financial bankruptcy case: Chunghwa Picture Tubes, Ltd., in Taiwan in 2019. The teaching case addresses major topics in financial bankruptcy analytics to enable business students to learn how to analyze leveraged finance and distressed debt and to predict bankruptcy. It is a science, technology, engineering, and mathematics (STEM) teaching case with a project-based learning method. The learning goal of the teaching case is to inspire and encourage students through planned teaching activities. Students start by thinking through problems or situations and establishing a machine-learning project using computer-assisted audit technique (CAAT) software. After students conduct a self-directed project, the student can use the new knowledge to develop a new bankruptcy-case analysis.</p> <p> </p>

20

Chung, Heewon, e Jinseok Lee. "Iterative Semi-Supervised Learning Using Softmax Probability". Computers, Materials & Continua 72, n.º 3 (2022): 5607–28. http://dx.doi.org/10.32604/cmc.2022.028154.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Rastogi (nee Khemchandani), Reshma, e Sambhav Jain. "Multi-label learning via minimax probability machine". International Journal of Approximate Reasoning 145 (junho de 2022): 1–17. http://dx.doi.org/10.1016/j.ijar.2022.02.002.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

White, Chris M., e Derek J. Koehler. "Missing information in multiple-cue probability learning". Memory & Cognition 32, n.º 6 (setembro de 2004): 1007–18. http://dx.doi.org/10.3758/bf03196877.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Munro, D. J., O. K. Ersoy, M. R. Bell e J. S. Sadowsky. "Neural network learning of low-probability events". IEEE Transactions on Aerospace and Electronic Systems 32, n.º 3 (julho de 1996): 898–910. http://dx.doi.org/10.1109/7.532251.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

White, Chris M., e Derek J. Koehler. "Choice strategies in multiple-cue probability learning." Journal of Experimental Psychology: Learning, Memory, and Cognition 33, n.º 4 (2007): 757–68. http://dx.doi.org/10.1037/0278-7393.33.4.757.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Koehler, Derek J. "Probability judgment in three-category classification learning." Journal of Experimental Psychology: Learning, Memory, and Cognition 26, n.º 1 (2000): 28–52. http://dx.doi.org/10.1037/0278-7393.26.1.28.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Braga-Neto, Ulisses M., e Edward R. Dougherty. "Machine Learning Requires Probability and Statistics [Perspectives]". IEEE Signal Processing Magazine 37, n.º 4 (julho de 2020): 118–22. http://dx.doi.org/10.1109/msp.2020.2985385.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Cano, Andrés, Manuel Gómez-Olmedo, Serafín Moral, Cora B. Pérez-Ariza e Antonio Salmerón. "Learning recursive probability trees from probabilistic potentials". International Journal of Approximate Reasoning 53, n.º 9 (dezembro de 2012): 1367–87. http://dx.doi.org/10.1016/j.ijar.2012.06.026.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

FIORI, SIMONE. "PROBABILITY DENSITY FUNCTION LEARNING BY UNSUPERVISED NEURONS". International Journal of Neural Systems 11, n.º 05 (outubro de 2001): 399–417. http://dx.doi.org/10.1142/s0129065701000898.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

In a recent work, we introduced the concept of pseudo-polynomial adaptive activation function neuron (FAN) and presented an unsupervised information-theoretic learning theory for such structure. The learning model is based on entropy optimization and provides a way of learning probability distributions from incomplete data. The aim of the present paper is to illustrate some theoretical features of the FAN neuron, to extend its learning theory to asymmetrical density function approximation, and to provide an analytical and numerical comparison with other known density function estimation methods, with special emphasis to the universal approximation ability. The paper also provides a survey of PDF learning from incomplete data, as well as results of several experiments performed on real-world problems and signals.

29

Yang, Hongkang. "A Mathematical Framework for Learning Probability Distributions". Journal of Machine Learning 1, n.º 4 (junho de 2022): 373–431. http://dx.doi.org/10.4208/jml.221202.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Storkel, Holly L. "Learning New Words". Journal of Speech, Language, and Hearing Research 44, n.º 6 (dezembro de 2001): 1321–37. http://dx.doi.org/10.1044/1092-4388(2001/103).

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

Though the influences of syntactic and semantic regularity on novel word learning are well documented, considerably less is known about the influence of phono-logical regularities on lexical acquisition. The influence of phonotactic probability, a measure of the likelihood of occurrence of a sound sequence, on novel word learning is investigated in this study. Thirty-four typically developing children (from ages 3 years 2 months to 6 years 3 months) participated in a multitrial word-learning task involving nonwords of varying phonotactic probability (common vs. rare) paired with unfamiliar object referents. Form and referent learning were tested following increasing numbers of exposures (1 vs. 4 vs. 7) and following a 1-week delay. Correct responses were analyzed to determine whether phonotactic probability affected rate of word learning, and incorrect responses were analyzed to examine whether phonotactic probability affected the formation of semantic representations, lexical representations, or the association between semantic and lexical representations. Results indicated that common sound sequences were learned more rapidly than rare sound sequences across form and referent learning. In addition, phonotactic probability appeared to nfluence the formation of semantic representations and the association between semantic and lexical representations. These results are integrated with previous findings and theoretical models of language acquisition.

31

Wijaya, Ariyadi, Elmaini Elmaini e Michiel Doorman. "A LEARNING TRAJECTORY FOR PROBABILITY: A CASE OF GAME-BASED LEARNING". Journal on Mathematics Education 12, n.º 1 (1 de janeiro de 2021): 1–16. http://dx.doi.org/10.22342/jme.12.1.12836.1-16.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

This research is aimed to describe a learning trajectory for probability through game-based learning. The research employed design research consisting of three stages: preparing for the experiment, design experiment, and retrospective analysis. A hypothetical learning trajectory (HLT) using Sudoku and Snake-and-ladder games was developed by collecting data through documentation, interviews, and classroom observations. The HLT was implemented in the classroom to investigate students’ actual learning trajectory. The results of this research indicate that the games helped students understand the concept of probability. The learning trajectory for probability based on game-based learning is seen from the perspective of four levels of emergent modeling. In the first level – ‘situational level’ – Sudoku and Ladder-and-Snake games were played by students. The second level is the ‘referential level’ where the rules of the games were used as a starting point to learn the concept of probability. Communication during game playing stimulated students' knowledge about random events, sample spaces, sample points, and events. At the third level – ‘general level’ – students used tree and table diagrams to generalize possible outcomes of an experiment and develop an understanding of sample spaces and sample points. Lastly, at the ‘formal level’ students developed their informal knowledge into formal concepts of probabilities.

32

Gnanasagaran, Durga, e Abdul Halim Amat @ Kamaruddin. "The effectiveness of mobile learning in the teaching and learning of probability". Jurnal Pendidikan Sains Dan Matematik Malaysia 9, n.º 2 (6 de dezembro de 2019): 9–15. http://dx.doi.org/10.37134/jpsmm.vol9.2.2.2019.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

This study investigates the effectiveness of mobile learning in the teaching and learning of Probability. The context of mobile here is not just restrained to gadgets such as smartphones but also the fact that teaching and learning can occur beyond boundaries and anywhere according to the convenience and personal preference of the students. This study made use of the pretest – posttest quasi experimental design and the students chosen for the study were from a pre-university college located in the northern region of the country. A total of 92 students made up the sample of the study. There were 46 students each in the experimental and control groups respectively. Cluster random sampling was employed as the sampling method here. The instrument used to collect data with the aim of strengthening the outcome of the study was the achievement test. A quantitative approach was undertaken specifically to analyse the obtained data. The paired sample t-test and independent sample t-test were executed in the data analysis process. Initially, every student involved in the study regardless of the group they were in possessed equal strength in their understanding of the content being covered as indicated by the results of their pre-test. The paired sample t-test yielded p < 0.05 which meant that there was a significant difference between the mean score of the pre-test and post-test in the experimental group and control group respectively. The outcome of the independent sample t-test showed that there was a significant difference between the mean score of the experimental group and that of the control group in the post-test (p < 0.05). This indicated that the treatment via mobile learning had indeed played a role in the improved performance of students in Probability, hence proving the effectiveness of mobile learning in the teaching and learning of Probability.

33

Don, Hilary J., A. Ross Otto, Astin C. Cornwall, Tyler Davis e Darrell A. Worthy. "Learning reward frequency over reward probability: A tale of two learning rules". Cognition 193 (dezembro de 2019): 104042. http://dx.doi.org/10.1016/j.cognition.2019.104042.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

CHERNOFF, EGAN J., EFI PAPARISTODEMOU, DIONYSIA BAKOGIANNI e PETER PETOCZ. "RESEARCH ON LEARNING AND TEACHING PROBABILITY WITHIN STATISTICS". STATISTICS EDUCATION RESEARCH JOURNAL 15, n.º 2 (30 de novembro de 2016): 6–10. http://dx.doi.org/10.52041/serj.v15i2.600.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Kosiashvili, D. "Probability of poverty: PPI analysis by machine learning". 101, n.º 101 (30 de dezembro de 2021): 141–47. http://dx.doi.org/10.26565/2311-2379-2021-101-14.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

Recently, poverty has been recognized as a global problem. Poverty Probability Index (PPI) is one of the tools to measure it. Based on the survey results on household characteristics and asset ownership, the PPI calculates the likelihood that a household lives below the poverty line. PPI is currently used by more than 400 organizations around the world – international NGOs, social services, donors, investors, multinational corporations, government and other organizations in various sectors including agriculture, health, education, energy and finance. The most famous PPI-based projects include the “Hunger” and “Electronic Warehouse” projects, Starbucks' strategy for Colombian farmers. However, the basic model with two classes (poor-rich), which underlies the index, does not classify the majority of the population with an average level of income, which has a chance of both getting rich and falling into the poor class over time and under the influence of various exogenous factors. Therefore, the work suggests a clustering model, which allows to identify 3 categories of the population: in addition to the poor and the rich, it also considers people with average earnings. 1) The class of the poor includes people of middle and old age living in villages. In most cases, these are married women with low literacy rates, who do not have their own business, bank account, and often a telephone. 2) An average earner is often a young married man with a good education. In most cases, he is neither an investor nor a business owner, he does not have a home to rent. At the same time, he usually owns at least 2 phones. 3) The class of the rich includes people of both sexes, both single and with a family. These are highly educated people who most likely have a business, investments, apartments for rent. The proposed model will help to develop more accurate tools for both poverty alleviation and prevention.

36

Kertész, Gábor. "Deep Metric Learning Using Negative Sampling Probability Annealing". Sensors 22, n.º 19 (6 de outubro de 2022): 7579. http://dx.doi.org/10.3390/s22197579.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

Multiple studies have concluded that the selection of input samples is key for deep metric learning. For triplet networks, the selection of the anchor, positive, and negative pairs is referred to as triplet mining. The selection of the negatives is considered the be the most complicated task, due to a large number of possibilities. The goal is to select a negative that results in a positive triplet loss; however, there are multiple approaches for this—semi-hard negative mining or hardest mining are well-known in addition to random selection. Since its introduction, semi-hard mining was proven to outperform other negative mining techniques; however, in recent years, the selection of the so-called hardest negative has shown promising results in different experiments. This paper introduces a novel negative sampling solution based on dynamic policy switching, referred to as negative sampling probability annealing, which aims to exploit the positives of all approaches. Results are validated on an experimental synthetic dataset using cluster-analysis methods; finally, the discriminative abilities of trained models are measured on real-life data.

37

González-Santander, Juan Luis. "A probability problem suitable for Problem-Based Learning". Nereis. Interdisciplinary Ibero-American Journal of Methods, Modelling and Simulation., n.º 13 (15 de novembro de 2021): 165–72. http://dx.doi.org/10.46583/nereis_2021.13.782.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

We propose a simple probability problem for undergraduate level. This problem involves different branches of Mathematics, such as Graph Theory, Linear Algebra or hypergeometric sums, hence it is quite suitable to be used as Problem-Based Learning. In addition, the problem allows several variations so that it may be proposed to different groups of students at the same time.

38

Yeh, Wei-Chang, Edward Lin e Chia-Ling Huang. "Predicting Spread Probability of Learning-Effect Computer Virus". Complexity 2021 (10 de julho de 2021): 1–17. http://dx.doi.org/10.1155/2021/6672630.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Resumo:

With the rapid development of network technology, computer viruses have developed at a fast pace. The threat of computer viruses persists because of the constant demand for computers and networks. When a computer virus infects a facility, the virus seeks to invade other facilities in the network by exploiting the convenience of the network protocol and the high connectivity of the network. Hence, there is an increasing need for accurate calculation of the probability of computer-virus-infected areas for developing corresponding strategies, for example, based on the possible virus-infected areas, to interrupt the relevant connections between the uninfected and infected computers in time. The spread of the computer virus forms a scale-free network whose node degree follows the power rule. A novel algorithm based on the binary-addition tree algorithm (BAT) is proposed to effectively predict the spread of computer viruses. The proposed BAT utilizes the probability derived from PageRank from the scale-free network together with the consideration of state vectors with both the temporal and learning effects. The performance of the proposed algorithm was verified via numerous experiments.

39

Catrambone, Richard, e Keith J. Holyoak. "Learning subgoals and methods for solving probability problems". Memory & Cognition 18, n.º 6 (novembro de 1990): 593–603. http://dx.doi.org/10.3758/bf03197102.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Kaizhu Huang, Haiqin Yang, Irwin King e M. R. Lyu. "Imbalanced learning with a biased minimax probability machine". IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 36, n.º 4 (agosto de 2006): 913–23. http://dx.doi.org/10.1109/tsmcb.2006.870610.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Jović, Srđan, Milica Miljković, Miljan Ivanović, Milena Šaranović e Milena Arsić. "Prostate Cancer Probability Prediction By Machine Learning Technique". Cancer Investigation 35, n.º 10 (26 de novembro de 2017): 647–51. http://dx.doi.org/10.1080/07357907.2017.1406496.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Movellan, Javier R., e James L. McClelland. "Learning Continuous Probability Distributions with Symmetric Diffusion Networks". Cognitive Science 17, n.º 4 (outubro de 1993): 463–96. http://dx.doi.org/10.1207/s15516709cog1704_1.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Meade, R., B. Backus e Q. Haijiang. "Cue probability learning by the human perceptual system". Journal of Vision 9, n.º 8 (23 de março de 2010): 42. http://dx.doi.org/10.1167/9.8.42.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Delgado, M. R., M. M. Miller, S. Inati e E. A. Phelps. "An fMRI study of reward-related probability learning". NeuroImage 24, n.º 3 (fevereiro de 2005): 862–73. http://dx.doi.org/10.1016/j.neuroimage.2004.10.002.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Cozman, Fabio Gagliardi. "Learning imprecise probability models: Conceptual and practical challenges". International Journal of Approximate Reasoning 55, n.º 7 (outubro de 2014): 1594–96. http://dx.doi.org/10.1016/j.ijar.2014.04.016.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Gaál, Zsófia Anna, Roland Boha, Brigitta Tóth e Márk Molnár. "Aging effect in an emotional probability learning task". International Journal of Psychophysiology 77, n.º 3 (setembro de 2010): 257–58. http://dx.doi.org/10.1016/j.ijpsycho.2010.06.079.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Balata, Alessandro, Michael Ludkovski, Aditya Maheshwari e Jan Palczewski. "Statistical learning for probability-constrained stochastic optimal control". European Journal of Operational Research 290, n.º 2 (abril de 2021): 640–56. http://dx.doi.org/10.1016/j.ejor.2020.08.041.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

T. Henry de Frahan, Marc, Shashank Yellapantula, Ryan King, Marc S. Day e Ray W. Grout. "Deep learning for presumed probability density function models". Combustion and Flame 208 (outubro de 2019): 436–50. http://dx.doi.org/10.1016/j.combustflame.2019.07.015.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Xue, Di, Jingmei Li, Tu Lv, Weifei Wu e Jiaxiang Wang. "Malware Classification Using Probability Scoring and Machine Learning". IEEE Access 7 (2019): 91641–56. http://dx.doi.org/10.1109/access.2019.2927552.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Rojarath, Artitayapron, e Wararat Songpan. "Probability-Weighted Voting Ensemble Learning for Classification Model". Journal of Advances in Information Technology 11, n.º 4 (2020): 217–27. http://dx.doi.org/10.12720/jait.11.4.217-227.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Artigos de revistas sobre o tema "Probability learning"

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos