• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 171
  • 80
  • 52
  • 12
  • 7
  • 5
  • 5
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 432
  • 94
  • 86
  • 45
  • 44
  • 34
  • 34
  • 33
  • 30
  • 28
  • 27
  • 27
  • 26
  • 26
  • 22
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Models of memory and relearning

Atkins, Paul William Bamkin January 1995 (has links)
No description available.
2

Conditioning and discrimination after nonreinforced stimulus preexposure

Honey, R. January 1987 (has links)
No description available.
3

Re-evaluating evaluative conditioning

Field, Andy January 1997 (has links)
No description available.
4

A Study on Interestingness Measures for Associative Classifiers

Jalali Heravi, Mojdeh 11 1900 (has links)
Associative classification is a rule-based approach to classify data relying on association rule mining by discovering associations between a set of features and a class label. Support and confidence are the de-facto interestingness measures used for discovering relevant association rules. The support-confidence framework has also been used in most, if not all, associative classifiers. Although support and confidence are appropriate measures for building a strong model in many cases, they are still not the ideal measures because in some cases a huge set of rules is generated which could hinder the effectiveness in some cases for which other measures could be better suited. There are many other rule interestingness measures already used in machine learning, data mining and statistics. This work focuses on using 53 different objective measures for associative classification rules. A wide range of UCI datasets are used to study the impact of different interestingness measures on different phases of associative classifiers based on the number of rules generated and the accuracy obtained. The results show that there are interestingness measures that can significantly reduce the number of rules for almost all datasets while the accuracy of the model is hardly jeopardized or even improved. However, no single measure can be introduced as an obvious winner.
5

Dimension of certain cleft binomial rings /

Montgomery, Martin, January 2006 (has links)
Thesis (Ph. D.)--University of Oregon, 2006. / Typescript. Includes vita and abstract. Includes bibliographical references (leaf 77). Also available for download via the World Wide Web; free to University of Oregon users.
6

Degree estimate and preserving problems

Li, Yunchang, 李云昌 January 2014 (has links)
published_or_final_version / Mathematics / Doctoral / Doctor of Philosophy
7

A Study on Interestingness Measures for Associative Classifiers

Jalali Heravi, Mojdeh Unknown Date
No description available.
8

Sparse matrix computations using the intelligent file store

El-Zein, Ahmad A. January 1992 (has links)
No description available.
9

Delay and knowledge mediation in human causal reasoning

Buehner, Marc January 2002 (has links)
Contemporary theories of causal induction have focussed largely on the question of how evidence in the form of covariations between causes and effects is used to compute measures of causal strength. A very important precursor enabling such computations is that the reasoner notices that a cause and effect have co-occurred. Standard laboratory experiments have usually bypassed this problem by presenting participants directly with covariational information. As a result, relatively little is known about how humans identify causal relations in real time. What evidence exists, however, paints a rather unflattering picture of human causal induction and converges to the conclusion that humans cannot identify causal relations if cause and effect are separated by more than a few seconds. Associative learning theory has interpreted these findings to indicate that temporal contiguity is essential to causal inference. I argue instead that contiguity is not essential, but that the influence of time in causal inference is crucially dependent on people's beliefs and expectations about the timeframe of the causal relation in question. First I demonstrate that humans are capable of dissociating temporal contiguity from causal strength; more specifically, they can learn that a given event exerts a stronger causal influence when it is temporally separated from the effect than when it is contiguous with it. Then I re-investigate a paradigm commonly used to study the effects of delay on human causal induction. My experiments employed one crucial additional manipulation regarding participants' awareness of potential delays. This manipulation was sufficient to reduce the detrimental effects of delay. Three other experiments employed a similar strategy, but relied on implicit instructions about the timeframe of the causal relation in question. Overall, results support the hypothesis that knowledge mediates the timeframe of covariation assessment in human causal induction. Implications for associative learning and causal power theories are discussed.
10

Linear associative algebras of infinite rank whose elements satisfy finite algebraic equations

Conwell, Herman Henry, January 1931 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1931. / Typescript. With this is bound: Linear associative algebras of infinite rank whose elements satisfy finite algebraic equations / by H.H. Conwell. Reprinted from Bulletin of the American Mathematical Society (Feb. 1934), p. 95-102. Includes bibliographical references.

Page generated in 0.0649 seconds