<?xml version="1.0" encoding="ISO8859-1"?>
<records>
  <record>
    <language>eng</language>
    <publisher>TQMP</publisher>
    <journalTitle>Tutorials in Quantitative Methods for Psychology</journalTitle>
    <issn>1913-4126</issn>
    <publicationDate>2010-03-01</publicationDate>
    <volume>6</volume>
    <issue>1</issue>
    <startPage>1</startPage>
    <endPage>15</endPage>
    <documentType>article</documentType>
    <title language="eng">The Application of Canonical Correlation to Two-Dimensional Contingency Tables</title>

    <authors>
      <author>
        <name>Howard B. Lee</name>
        <email>howard.lee@csun.edu</email>
        <affiliationId>1</affiliationId>
      </author>

      <author>
        <name>Gary S. Katz</name>
        <email>gary.katz@csun.edu</email>
        <affiliationId>1</affiliationId>
      </author>


      <author>
        <name>Alberto F. Restori</name>
        <email>alberto.restori@csun.edu</email>
        <affiliationId>1</affiliationId>
      </author>



    </authors>

    <affiliationsList>
      <affiliationName affiliationId="1">California State University, Northridge</affiliationName>




    </affiliationsList>

    <abstract language="eng">
       This paper re-introduces and demonstrates the use of Mickey’s (1970) canonical correlation method in analyzing large two-dimensional contingency tables. This method of analysis supplements the traditional analysis using the Pearson chi-square. Examples and a MATLAB source listing are provided.  
    </abstract>

    <fullTextUrl format="pdf">http://www.tqmp.org/Content/vol06-1/p001/p001.pdf</fullTextUrl>

    <keywords language="eng">    
      <keyword>Stastitics</keyword>

      <keyword>Canonical correlation</keyword>


      <keyword>Contingency table</keyword>



    </keywords>
  </record>

  <record>
    <language>eng</language>
    <publisher>TQMP</publisher>
    <journalTitle>Tutorials in Quantitative Methods for Psychology</journalTitle>
    <issn>1913-4126</issn>
    <publicationDate>2010-03-01</publicationDate>
    <volume>6</volume>
    <issue>1</issue>
    <startPage>16</startPage>
    <endPage>30</endPage>
    <documentType>article</documentType>
    <title language="eng">Assessing Conceptual Complexity and Compressibility Using Information Gain and Mutual Information</title>

    <authors>
      <author>
        <name>Fabien Mathy</name>
        <email>fabien.mathy@univ-fcomte.fr</email>
        <affiliationId>1</affiliationId>
      </author>




    </authors>

    <affiliationsList>
      <affiliationName affiliationId="1">Université de Franche-Comté</affiliationName>




    </affiliationsList>

    <abstract language="eng">
       In this paper, a few basic notions stemming from information theory are presented with the intention of modeling the abstraction of relevant information in categorization tasks. In a categorization task, a single output variable is the basis for performing a dichotomic classification of objects that can be distinguished by a set of input variables which are more or less informative about the category to which the objects belong. At the beginning of the experiment, the target classification is unknown to learners who must select the most informative variables relative to the class in order to succeed in classifying the objects efficiently. I first show how the notion of entropy can be used to characterize basic psychological processes in learning. Then, I indicate how a learner might use information gain and mutual information –both based on entropy– to efficiently induce the shortest rule for categorizing a set of objects. Several basic classification tasks are studied in succession with the aim of showing that learning can improve as long as subjects are able to compress information. Referring to recent experimental results, I indicate in the Conclusion that these notions can account for both strategies and performance in subjects trying to simplify a learning process.  
    </abstract>

    <fullTextUrl format="pdf">http://www.tqmp.org/Content/vol06-1/p016/p016.pdf</fullTextUrl>

    <keywords language="eng">    
      <keyword>Information theory</keyword>

      <keyword>Information gain and mutual information</keyword>




    </keywords>
  </record>

  <record>
    <language>eng</language>
    <publisher>TQMP</publisher>
    <journalTitle>Tutorials in Quantitative Methods for Psychology</journalTitle>
    <issn>1913-4126</issn>
    <publicationDate>2010-03-01</publicationDate>
    <volume>6</volume>
    <issue>1</issue>
    <startPage>31</startPage>
    <endPage>38</endPage>
    <documentType>article</documentType>
    <title language="eng">An Introduction to Independent Component Analysis: InfoMax and FastICA algorithms</title>

    <authors>
      <author>
        <name>Dominic Langlois</name>
        <email>mystarel@gmail.com</email>
        <affiliationId>1</affiliationId>
      </author>

      <author>
        <name>Sylvain Chartier</name>
        <email>sylvain.chartier@uottawa.ca</email>
        <affiliationId>1</affiliationId>
      </author>


      <author>
        <name>Dominique Gosselin</name>
        <email>dgoss085@uottawa.ca</email>
        <affiliationId>1</affiliationId>
      </author>



    </authors>

    <affiliationsList>
      <affiliationName affiliationId="1">University of Ottawa</affiliationName>




    </affiliationsList>

    <abstract language="eng">
       This paper presents an introduction to independent component analysis (ICA). Unlike principal component analysis, which is based on the assumptions of uncorrelatedness and normality, ICA is rooted in the assumption of statistical independence. Foundations and basic knowledge necessary to understand the technique are provided hereafter. Also included is a short tutorial illustrating the implementation of two ICA algorithms (FastICA and InfoMax) with the use of the Mathematica software.  
    </abstract>

    <fullTextUrl format="pdf">http://www.tqmp.org/Content/vol06-1/p031/p031.pdf</fullTextUrl>

    <keywords language="eng">    
      <keyword>Statistics</keyword>

      <keyword>Independent component analysis</keyword>




    </keywords>
  </record>


</records>

