This thesis examined the role of procedural learning in human probabilistic category learning (PCL). It was proposed that there was a lack of clear behavioural evidence for learning without awareness in PCL. Eleven experiments are reported that investigated the characteristics of learning in a prototypical probabilistic category learning task (the weather prediction task). The results were interpreted as contradicting the popular interpretation of weather prediction task learning as procedurally based. Rather, it was shown that behavioural data was consistent with declarative learning. This learning was not dissociable with measures of cue knowledge. Strategy analysis converged with the behavioural data, suggesting the dominance of declarative learning in this task. It was proposed that a single system account (e.g., Lagnado et al., 2006; Newell et al., 2007) which does not posit a role for procedural learning was the most appropriate way to understand learning in the weather prediction task.

This thesis examined the role of procedural learning in human probabilistic category learning (PCL). It was proposed that there was a lack of clear behavioural evidence for learning without awareness in PCL. Eleven experiments are reported that investigated the characteristics of learning in a prototypical probabilistic category learning task (the weather prediction task). The results were interpreted as contradicting the popular interpretation of weather prediction task learning as procedurally based. Rather, it was shown that behavioural data was consistent with declarative learning. This learning was not dissociable with measures of cue knowledge. Strategy analysis converged with the behavioural data, suggesting the dominance of declarative learning in this task. It was proposed that a single system account (e.g., Lagnado et al., 2006; Newell et al., 2007) which does not posit a role for procedural learning was the most appropriate way to understand learning in the weather prediction task.

As text repositories grow in number and size and global connectivity improves, the amount of online information in the form of free-format text is growing extremely rapidly. In many large organizations, huge volumes of textual information are created and maintained, and there is a pressing need to support efficient and effective information retrieval, filtering, and management. Text categorization is essential to the efficient management and retrieval of documents. Past research on text categorization mainly focused on developing or adopting statistical classification or inductive learning methods for automatically discovering text categorization patterns from a training set of manually categorized documents. However, as documents accumulate, the pre-defined categories may not capture the characteristics of the documents. In this study, we proposed a mining-based category evolution (MiCE) technique to adjust the categories based on the existing categories and their associated documents. According to the empirical evaluation results, the proposed technique, MiCE, was more effective than the discovery-based category management approach, insensitive to the quality of original categories, and capable of improving classification accuracy.

This master thesis characterizes a process of the Category Management and its benefits. Furthermore, it describes the use of the Category Management in a selected retail chain and a process of creating Category Business Plans. The master thesis ends by an application of the Category Management and Category Business Plans theory on an illustrative case of a Beer Business Plan.

This thesis deals with the fields of category management. Category management is a process that focuses on effective product management at the level of each category. Category management process consists of defining categories, determining the role of category, assignment strategy category, tactics and implementation. For process of category management is crucial correct identification of consumer and his needs. Consumer decision making is affected by external and internal factors. Internal factors include effects on the personality level, such as learning, perception and motivation. Among the external factors include decision-making based on perception of price, brand, merchandising, or packaging.

Trial-level evidence for feedback sensitivity in fixations during category learning has been previously described as weak. In this dissertation, steps were taken to overcome some methodological issues potentially obscuring the evidence for such sensitivity. Jointly, the three experiments reported here suggest that sensitivity to error in visual attention reflects cue competition, as opposed to error-driven learning of a selective visual profile. These outcomes are in agreement with previous research in human vision, which holds that fixations reflect the agent’s task representation. A case is made for the top-down control of visual attention during category learning, manifested as effects of prior knowledge, long-standing expectations, decisional uncertainty, and vacillations between alternative sources of conflicting evidence. A suggestion is made that the time-based measures of visual attention may align with the continuous ratings of the perceived category membership (reflecting learner confidence).

No description available.

No description available.

No description available.

L’objectif de ce travail est l’étude de l’opérade Swiss-Cheese SCd qui est une version relative del’opérade des petits cubes Cd. On montre que les théorèmes classiques dans le cadre des opérades non colorées admettent des analogues dans le cas relatif. Il est ainsi possible d’extraire d’une opérade pointée O (i.e. un opérade colorée sous π₀(SC₁) ) un couple d’espaces semi-cosimpliciaux (Oc ; O₀) dont les semitotalisations sont faiblement équivalentes à une SC₂-algèbre explicite. En particulier, on prouve que le couple (ℒ1 ; n ; ℒm ; n), composé de l’espace des longs nœuds et de l’espace des longs entrelacs à m brins, est faiblement équivalent à une SC₂-algèbre explicite. Dans un second temps, on s’intéresse aux couples d’homologies singulières et d’homologies de Hochschild associés à une paire d’espaces semi-cosimpliciaux provenant d’une opérade pointée. Dans ce contexte, les couples (H∗ (sTot(Oc)) ; H∗ (sTot(O₀))) et (HH∗(Oc) ; HH∗(O₀)) possèdent tous deux une structure de H∗(SC₂)-algèbre explicite. On montre alors que le morphisme de Bousfield entre ces deux couples préserve les structures de H∗(SC₂)-algèbres. Cela nous permet de mieux appréhender le couple de suites spectrales de Bousfield calculant (H∗(sTot(Oc)) ; H∗(sTot(O₀))). En particulier, on énonce un critère permettant de faire le lien entre le couple d’homologies singulières issu d’une opérade symétrique multiplicative topologique et la page E² des suites spectrales de Bousfield. La dernière étape de notre étude consiste à généraliser les précédents résultats. Pour cela, on se base sur une conjecture de Dwyer et Hess qui vise à identifier une Cd₊₁-algèbre à partir d’un morphisme d’opérades Cd → O. En admettant ce résultat, on introduit une opérade colorée CCd telle que l’on peut extraire une SCd₊₁-algèbre à partir d’un morphisme d’opérades colorées CCd→ O. On montre ainsi que le couple d’espaces (ℒᵈ₁ ; n ; T∞Imm(ᴷ))(Rᵈ ; Rⁿ), composé de l’espace des longs nœuds en dimension d et de l’approximation polynomiale des (k)-immersions, est faiblement équivalent à une SCd₊₁-algèbre explicite. / The aim of this work is to study the Swiss-Cheese operad, denoted by SCd, which is a relative version of the little cubes operad Cd.We show that the classical theorems in the context of uncolored operads can begeneralized to the relative case. From a pointed operad O (i.e. a two colored operad under π0(SC₁) ), webuild two semi-cosimplicial spaces (Oc ; Oo) such that the pair of semi-totalizations is weakly equivalentto an explicit SC₂-algebra. In particular, we prove that the pair (ℒ₁ ; n ; ℒm; n), composed of the space oflong knots and the space of long links, is weakly equivalent to an explicit SC₂-algebra.We study two homology theories, namely singular and Hochschild homology, of a pair of semicosimplicialspaces arising from a pointed operad. In this context, (H∗(sTot(Oc)) ; H∗(sTot(Oo))) and (HH∗(Oc) ; HH∗(Oo)) are equipped with an explicit H∗(SC₂)-algebra structure. We show that the mapintroduced by Bousfield between these two pairs is a morphism of H∗(SC₂)-algebras. This result helps us to understand the pair of spectral sequences computing (H∗(sTot(Oc)) ; H∗(sTot(Oo))). In particular wegive some conditions on a multiplicative symmetric operad so that the E² pages of the Bousfield spectral sequences are weakly equivalent to H∗(sTot(Oc)) and H∗(sTot(Oo)) as H∗(SC₂)-algebras. Finally we generalize our previous results, relying on a conjecture by Dwyer and Hess. We define acolored operad CCd and obtain an SCd₊₁-algebra from an operad morphism CCd → O. As a consequence, we prove that the couple of topological spaces (ℒᵈ₁ ; n ; T∞Imm(ᴷ))(Rᵈ ; Rⁿ)), where Ld₁;n is the space of long knots from Rd to Rⁿ and where T∞Imm(k)(Rᵈ ; Rⁿ) is the polynomial approximation of the (k)-immersions,is weakly equivalent to an explicit SCd+₁-algebra.