You can subscribe to this list here.
2001 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(10) 
_{Aug}
(5) 
_{Sep}
(3) 
_{Oct}
(41) 
_{Nov}
(41) 
_{Dec}
(33) 

2002 
_{Jan}
(75) 
_{Feb}
(10) 
_{Mar}
(170) 
_{Apr}
(174) 
_{May}
(66) 
_{Jun}
(11) 
_{Jul}
(10) 
_{Aug}
(44) 
_{Sep}
(73) 
_{Oct}
(28) 
_{Nov}
(139) 
_{Dec}
(52) 
2003 
_{Jan}
(35) 
_{Feb}
(93) 
_{Mar}
(62) 
_{Apr}
(10) 
_{May}
(55) 
_{Jun}
(70) 
_{Jul}
(37) 
_{Aug}
(16) 
_{Sep}
(56) 
_{Oct}
(31) 
_{Nov}
(57) 
_{Dec}
(83) 
2004 
_{Jan}
(85) 
_{Feb}
(67) 
_{Mar}
(27) 
_{Apr}
(37) 
_{May}
(75) 
_{Jun}
(85) 
_{Jul}
(160) 
_{Aug}
(68) 
_{Sep}
(104) 
_{Oct}
(25) 
_{Nov}
(39) 
_{Dec}
(23) 
2005 
_{Jan}
(10) 
_{Feb}
(45) 
_{Mar}
(43) 
_{Apr}
(19) 
_{May}
(108) 
_{Jun}
(31) 
_{Jul}
(41) 
_{Aug}
(23) 
_{Sep}
(65) 
_{Oct}
(58) 
_{Nov}
(44) 
_{Dec}
(54) 
2006 
_{Jan}
(96) 
_{Feb}
(27) 
_{Mar}
(69) 
_{Apr}
(59) 
_{May}
(67) 
_{Jun}
(35) 
_{Jul}
(13) 
_{Aug}
(461) 
_{Sep}
(160) 
_{Oct}
(399) 
_{Nov}
(32) 
_{Dec}
(72) 
2007 
_{Jan}
(316) 
_{Feb}
(305) 
_{Mar}
(318) 
_{Apr}
(54) 
_{May}
(194) 
_{Jun}
(173) 
_{Jul}
(282) 
_{Aug}
(91) 
_{Sep}
(227) 
_{Oct}
(365) 
_{Nov}
(168) 
_{Dec}
(18) 
2008 
_{Jan}
(71) 
_{Feb}
(111) 
_{Mar}
(155) 
_{Apr}
(173) 
_{May}
(70) 
_{Jun}
(67) 
_{Jul}
(55) 
_{Aug}
(83) 
_{Sep}
(32) 
_{Oct}
(68) 
_{Nov}
(80) 
_{Dec}
(29) 
2009 
_{Jan}
(46) 
_{Feb}
(18) 
_{Mar}
(95) 
_{Apr}
(76) 
_{May}
(140) 
_{Jun}
(98) 
_{Jul}
(84) 
_{Aug}
(123) 
_{Sep}
(94) 
_{Oct}
(131) 
_{Nov}
(142) 
_{Dec}
(125) 
2010 
_{Jan}
(128) 
_{Feb}
(158) 
_{Mar}
(172) 
_{Apr}
(134) 
_{May}
(94) 
_{Jun}
(84) 
_{Jul}
(32) 
_{Aug}
(127) 
_{Sep}
(167) 
_{Oct}
(109) 
_{Nov}
(69) 
_{Dec}
(78) 
2011 
_{Jan}
(39) 
_{Feb}
(58) 
_{Mar}
(52) 
_{Apr}
(47) 
_{May}
(56) 
_{Jun}
(76) 
_{Jul}
(55) 
_{Aug}
(54) 
_{Sep}
(165) 
_{Oct}
(255) 
_{Nov}
(328) 
_{Dec}
(263) 
2012 
_{Jan}
(82) 
_{Feb}
(147) 
_{Mar}
(400) 
_{Apr}
(216) 
_{May}
(209) 
_{Jun}
(160) 
_{Jul}
(86) 
_{Aug}
(141) 
_{Sep}
(156) 
_{Oct}
(6) 
_{Nov}

_{Dec}

S  M  T  W  T  F  S 




1
(1) 
2
(1) 
3

4

5

6
(3) 
7
(1) 
8
(5) 
9

10
(5) 
11
(2) 
12
(5) 
13
(3) 
14
(5) 
15
(3) 
16
(2) 
17

18
(7) 
19
(4) 
20
(6) 
21

22
(4) 
23
(3) 
24
(4) 
25
(3) 
26
(1) 
27
(10) 
28
(1) 
29
(1) 
30
(4) 
31


From: <schloegl@us...>  20090702 14:15:39

Revision: 5985 http://octave.svn.sourceforge.net/octave/?rev=5985&view=rev Author: schloegl Date: 20090702 12:27:35 +0000 (Thu, 02 Jul 2009) Log Message:  add classification methods, change license to GPL v3 or later, ver2.0 Modified Paths:  trunk/octaveforge/extra/NaN/COPYING trunk/octaveforge/extra/NaN/DESCRIPTION trunk/octaveforge/extra/NaN/doc/README.TXT Added Paths:  trunk/octaveforge/extra/NaN/inst/classify.m trunk/octaveforge/extra/NaN/inst/decovm.m trunk/octaveforge/extra/NaN/inst/kappa.m trunk/octaveforge/extra/NaN/inst/test_sc.m trunk/octaveforge/extra/NaN/inst/train_lda_sparse.m trunk/octaveforge/extra/NaN/inst/train_sc.m trunk/octaveforge/extra/NaN/inst/xval.m Modified: trunk/octaveforge/extra/NaN/COPYING ===================================================================  trunk/octaveforge/extra/NaN/COPYING 20090701 20:55:24 UTC (rev 5984) +++ trunk/octaveforge/extra/NaN/COPYING 20090702 12:27:35 UTC (rev 5985) @@ 1,283 +1,625 @@ GNU GENERAL PUBLIC LICENSE  Version 2, June 1991 + Version 3, 29 June 2007  Copyright (C) 1989, 1991 Free Software Foundation, Inc. <http://fsf.org/>; + Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>; Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble  The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free softwareto make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a programto make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things.  To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights.  We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it.  Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions.  Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on generalpurpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program nonfree. + The precise terms and conditions for copying, distribution and modification follow.   GNU GENERAL PUBLIC LICENSE  TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION  0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". + TERMS AND CONDITIONS Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. + 0. Definitions.  1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. + "This License" refers to version 3 of the GNU General Public License. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. + "Copyright" also means copyrightlike laws that apply to other kinds of +works, such as semiconductor masks.  2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations.  a) You must cause the modified files to carry prominent notices  stating that you changed the files and the date of any change. + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work.  b) You must cause any work that you distribute or publish, that in  whole or in part contains or is derived from the Program or any  part thereof, to be licensed as a whole at no charge to all third  parties under the terms of this License. + A "covered work" means either the unmodified Program or a work based +on the Program.  c) If the modified program normally reads commands interactively  when run, you must cause it, when started running for such  interactive use in the most ordinary way, to print or display an  announcement including an appropriate copyright notice and a  notice that there is no warranty (or else, saying that you provide  a warranty) and that users may redistribute the program under  these conditions, and telling the user how to view a copy of this  License. (Exception: if the Program itself is interactive but  does not normally print such an announcement, your work based on  the Program is not required to print an announcement.)  These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion.  3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: + 1. Source Code.  a) Accompany it with the complete corresponding machinereadable  source code, which must be distributed under the terms of Sections  1 and 2 above on a medium customarily used for software interchange; or, + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any nonsource +form of a work.  b) Accompany it with a written offer, valid for at least three  years, to give any third party, for a charge no more than your  cost of physically performing source distribution, a complete  machinereadable copy of the corresponding source code, to be  distributed under the terms of Sections 1 and 2 above on a medium  customarily used for software interchange; or, + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language.  c) Accompany it with the information you received as to the offer  to distribute corresponding source code. (This alternative is  allowed only for noncommercial distribution and only if you  received the program in object code or executable form with such  an offer, in accord with Subsection b above.) + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or generalpurpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code.   4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source.  5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. + The Corresponding Source for a work in source code form is that +same work.  6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From AntiCircumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +nonpermissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying NonSource Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machinereadable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peertopeer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or nonconsumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other nonpermissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or nonpermissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peertopeer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a crossclaim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of this License.  7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or + Each contributor grants you a nonexclusive, worldwide, royaltyfree +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the nonexercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royaltyfree redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. + 13. Use with the GNU Affero General Public License. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License.   8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. + 14. Revised Versions of this License.  9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation.  10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program.  NO WARRANTY + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version.  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + 15. Disclaimer of Warranty.  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + END OF TERMS AND CONDITIONS  + How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest @@ 286,15 +628,15 @@ To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least +state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. <one line to give the program's name and a brief idea of what it does.> Copyright (C) <year> <name of author>  This program is free software; you can redistribute it and/or modify + This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by  the Free Software Foundation; either version 2 of the License, or + the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, @@ 303,35 +645,30 @@ GNU General Public License for more details. You should have received a copy of the GNU General Public License  along with this program; if not, see <http://www.gnu.org/licenses/>;. + along with this program. If not, see <http://www.gnu.org/licenses/>;. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode:  Gnomovision version 69, Copyright (C) year name of author  Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + <program> Copyright (C) <year> <name of author> + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouseclicks or menu itemswhatever suits your program. +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +<http://www.gnu.org/licenses/>;.  Yoyodyne, Inc., hereby disclaims all copyright interest in the program  `Gnomovision' (which makes passes at compilers) written by James Hacker.   <signature of Ty Coon>, 1 April 1989  Ty Coon, President of Vice  This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +<http://www.gnu.org/philosophy/whynotlgpl.html>;. Modified: trunk/octaveforge/extra/NaN/DESCRIPTION ===================================================================  trunk/octaveforge/extra/NaN/DESCRIPTION 20090701 20:55:24 UTC (rev 5984) +++ trunk/octaveforge/extra/NaN/DESCRIPTION 20090702 12:27:35 UTC (rev 5985) @@ 1,10 +1,10 @@ Name: NaN Version: 1.0.9 Date: 20090503 +Version: 2.0.0 +Date: 20090630 Author: Alois Schloegl <a.schloegl@...> Maintainer: Matthew W. Roberts +Maintainer: Alois Schloegl Title: NaN statisical toolbox Description: Missing value statistical toolbox Depends: octave (>= 2.9.7) License: GPL version 2 or later Url: http://www.dpmi.tugraz.ac.at/~schloegl/matlab/NaN +Depends: octave (>= 3.0.1) +License: GPL version 3 or later +Url: http://hci.tugraz.ac.at/~schloegl/matlab/NaN Modified: trunk/octaveforge/extra/NaN/doc/README.TXT ===================================================================  trunk/octaveforge/extra/NaN/doc/README.TXT 20090701 20:55:24 UTC (rev 5984) +++ trunk/octaveforge/extra/NaN/doc/README.TXT 20090702 12:27:35 UTC (rev 5985) @@ 6,17 +6,19 @@ FEATURES of the NaNtb:   statistical toolbox +  classification toolobx  NaN's are treated as missing values   supports DIM argument   supports unbiased estimation   supports weightening of data +  supports DIM argument +  supports weightening of data +  less roundoff errors using extended double  less but more powerful functions (no nanFUN needed) +  supports unbiased estimation  fixes known bugs   compatible to Matlab and Octave +  compatible with Matlab and Octave  easy to use   The toolbox is tested with Octave 3.x and Matlab 7.x, FreeMat v3.6   +  The toolbox is tested with Octave 3.x and Matlab 7.x + + Currently are implemented:  level 1: basic functions (not derived) @@ 25,6 +27,8 @@ SUMSKIPNAN is central, it implements skipping NaN's, the DIMargument and returns the number of valid elements, too. COVM covariance estimation (several modes) + Roundoff errors avoided by using internally extended accuracy + DECOVM decomposes the extended covarianced matrix into mean and cov XCOVF crosscorrelation function NANFILTER filter function CONVSKIPNAN convolution @@ 38,34 +42,51 @@ rms, sem, skewness, statistic, std, var level 2: derived functions +level 2a: derived functions MEAN mean (options: arithmetic, geometric, harmonic)  SEM standard error of the mean (does not depend on distribution) VAR variance STD standard deviation MEDIAN median (currently only for 2dim matrices) + SEM standard error of the mean (does not depend on distribution) + TRIMMEAN trimmed mean + medAbsDev median absolute deviation + MEANSQ mean square RMS root mean square + STATISTIC estimates various statistics at once MOMENT moment SKEWNESS skewness KURTOSIS excess + +* IQR interquartile range MAD mean absolute deviation +* RANGE range (maxmin) + CENTER removes mean  ZSCORE normalizes x with z = (xmean)/std + ZSCORE normalizes x to zero mean and variance 1 (z = (xmean)/std) + zScoreMedian nonparametric zscore, normalizes is to zero median and 1/(1.483*median absolute deviation) + HARMMEAN harmonic mean GEOMEAN geometric mean + NANTEST checks whether all functions have been replaced DETREND detrending of data with missing values and nonequidistant sampled data + COR correlation matrix + COV covariance matrix CORRCOEF correlation coefficient, including rank correlation, significance test and confidence intervals SPEARMAN, RANKCORR spearman's rank correlation coefficient. They might be replaced by CORRCOEF.  COV covariance matrix + PARTCORRCOEF partial correlation coefficient RANKS calculates ranks for nonparametric statistics + TIEDRANK similar to RANKS, used for compatibility reasons + + QUANTILE qth quantile + PRCTILE,PERCENTILE pth percentile TRIMEAN trimean  QUANTILE qth quantile  PERCENTILE pth percentile + + ECDF empirical cumulative distribution function NORMPDF normal probability distribution NORMCDF normal cumulative distribution NORMINV inverse of the normal cumulative distribution @@ 73,9 +94,16 @@ TCDF student cumulative distribution TINV inverse of the student cumulative distribution NANSUM, NANSTD fixes for buggy versions included    + +level 2b: classification, crossvalidation + TRAIN_SC train classifier + TEST_SC test classifier + CLASSIFY classify data (no cross validation) + XVAL classify data with cross validation + KAPPA performance evaluation + TRAIN_LDA_SPARSE utility function + + REFERENCE(S):  [1] http://www.itl.nist.gov/ @@ 145,7 +173,7 @@ 12) NORMPDF, NORMCDF, NORMINV In the Matlab statistics toolbox V 3.0, NORMPDF, NORMCDF and NORMINV gave incorrect results for SIGMA=0; A Similar problem was observed in Octave +incorrect results for SIGMA=0; A similar problem was observed in Octave with NORMAL_INV, NORMAL_PDF, and NORMALCDF. The problem is fixed with this version. Furthermore, the check of the input Added: trunk/octaveforge/extra/NaN/inst/classify.m ===================================================================  trunk/octaveforge/extra/NaN/inst/classify.m (rev 0) +++ trunk/octaveforge/extra/NaN/inst/classify.m 20090702 12:27:35 UTC (rev 5985) @@ 0,0 +1,77 @@ +function [CLASS,ERR,POSTERIOR,LOGP,COEF]=classify(sample,training,classlabel,TYPE) +% CLASSIFY classifies sample data into categories +% defined by the training data and its group information +% +% CLASS = classify(sample, training, group) +% CLASS = classify(sample, training, group, TYPE) +% [CLASS,ERR,POSTERIOR,LOGP,COEF] = CLASSIFY(...) +% +% CLASS contains the assigned group. +% ERR is the classification error on the training set weighted by the +% prior propability of each group. +% +% The same classifier as in TRAIN_SC are supported. +% +% ATTENTION: no crossvalidation is applied, therefore the +% classification error is too optimistic (overfitting). +% Use XVAL instead to obtain crossvalidated performance. +% +% see also: TRAIN_SC, TEST_SC, XVAL +% +% References: +% [1] R. Duda, P. Hart, and D. Stork, Pattern Classification, second ed. +% John Wiley & Sons, 2001. + +% $Id: classify.m 2140 20090702 12:03:55Z schloegl $ +% Copyright (C) 2008,2009 by Alois Schloegl <a.schloegl@...> +% This function is part of the NaNtoolbox +% http://hci.tugraz.ac.at/~schloegl/matlab/NaN/ + +% This program is free software; you can redistribute it and/or +% modify it under the terms of the GNU General Public License +% as published by the Free Software Foundation; either version 3 +% of the License, or (at your option) any later version. +% +% This program is distributed in the hope that it will be useful, +% but WITHOUT ANY WARRANTY; without even the implied warranty of +% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +% GNU General Public License for more details. +% +% You should have received a copy of the GNU General Public License +% along with this program; if not, write to the Free Software +% Foundation, Inc., 59 Temple Place  Suite 330, Boston, MA 021111307, USA. + +if nargin<4 + TYPE = 'linear'; +end; + +if strcmp(TYPE,'linear') + TYPE = 'LDA'; +elseif strcmp(TYPE,'quadratic') + TYPE = 'QDA2'; % result is closer to Matlab +elseif strcmp(TYPE,'diagLinear') + TYPE = 'NBC'; +elseif strcmp(TYPE,'diagQuadratic') + TYPE = 'aNBC'; +elseif strcmp(TYPE,'mahalanobis') + TYPE = 'MDA'; +end; + +[group,I,classlabel] = unique(classlabel); + +CC = train_sc(training,classlabel,TYPE); +R = test_sc(CC,sample); +CLASS = group(R.classlabel); + +if nargout>1, + R = test_sc(CC,training,[],classlabel); + ERR = 1R.ACC; +end; + +if nargout>2, + warning('output arguments POSTERIOR,LOGP and COEF not supported') + POSTERIOR = []; + LOGP = []; + COEF = []; +end; + Property changes on: trunk/octaveforge/extra/NaN/inst/classify.m ___________________________________________________________________ Added: Id + test_sc.m Added: trunk/octaveforge/extra/NaN/inst/decovm.m ===================================================================  trunk/octaveforge/extra/NaN/inst/decovm.m (rev 0) +++ trunk/octaveforge/extra/NaN/inst/decovm.m 20090702 12:27:35 UTC (rev 5985) @@ 0,0 +1,78 @@ +function [mu,sd,COV,xc,M,R2]=decovm(XCN,NN) +% decompose extended covariance matrix into mean (mu), +% standard deviation, the (pure) Covariance (COV), +% correlation (xc) matrix and the correlation coefficients R2. +% NaN's are condsidered as missing values. +% [mu,sd,COV,xc,N,R2]=decovm(ECM[,NN]) +% +% ECM is the extended covariance matrix +% NN is the number of elements, each estimate (in ECM) is based on +% +% see also: MDBC, COVM, R2 + +% $Id: decovm.m 2140 20090702 12:03:55Z schloegl $ +% Copyright (c) 19992002,2009 by Alois Schloegl +% This function is part of the NaNtoolbox +% http://hci.tugraz.ac.at/~schloegl/matlab/NaN/ + +% This program is free software; you can redistribute it and/or +% modify it under the terms of the GNU General Public License +% as published by the Free Software Foundation; either version 3 +% of the License, or (at your option) any later version. +% +% This program is distributed in the hope that it will be useful, +% but WITHOUT ANY WARRANTY; without even the implied warranty of +% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +% GNU General Public License for more details. +% +% You should have received a copy of the GNU General Public License +% along with this program; if not, write to the Free Software +% Foundation, Inc., 59 Temple Place  Suite 330, Boston, MA 021111307, USA. + +[r,c]=size(XCN); +if r~=c, + fprintf(2,'Warning DECOVM: input argument is not a square matrix\n'); + XCN = ecovm(XCN); + c = c + 1 +else + M = XCN(1,1); + if nargin<2, + XCN = XCN/(XCN(1,1)); + else %if nargin==2 + XCN = XCN./(NN); + end; + + if any(isnan(XCN(:))), + warning('DECOVM: Extended Covariance Matrix should not contain NaN''s'); + end; + if 0, %det(XCN)<0; % check removed for performance reasons + warning('DECOVM: Extended Covariance Matrix must be nonnegative definite'); + end; +end; + +mu = XCN(1,2:c); +COV = XCN(2:c,2:c)  mu'*mu; +sd = sqrt(diag(COV))'; +if nargout<4, return; end; +xc = COV./(sd'*sd); +M = XCN(1,1); +if nargout<6, return; end; +R2 = xc.*xc; + +return; + +mu=XCN(2:N,1)/XCN(1,1); +COV=(XCN(2:N,2:N)/XCN(1,1)XCN(2:N,1)*XCN(1,2:N)/XCN(1,1)^2); +sd=sqrt(diag(COV)); +xc=COV./(sd*sd'); + +% function [ECM] = ecovm(signal); +% Generates extended Covariance matrix, +% ECM= [l signal]'*[l signal]; % l is a matching column of 1's +% ECM is additive, i.e. it can be applied to subsequent blocks and summed up afterwards +% [ECM1] = ecovm(s1); +% [ECM2] = ecovm(s1); +% [ECM] = ecovm([s1;s2]); +% ECM1+ECM2==ECM; +% +% SS=sum(signal); ECM=[[size(signal,1),SS];[SS',signal'*signal]]; Property changes on: trunk/octaveforge/extra/NaN/inst/decovm.m ___________________________________________________________________ Added: Id + test_sc.m Added: trunk/octaveforge/extra/NaN/inst/kappa.m ===================================================================  trunk/octaveforge/extra/NaN/inst/kappa.m (rev 0) +++ trunk/octaveforge/extra/NaN/inst/kappa.m 20090702 12:27:35 UTC (rev 5985) @@ 0,0 +1,183 @@ +function [kap,se,H,z,p0,SA,R]=kappa(d,c,arg3,w); +% KAPPA estimates Cohen's kappa coefficient +% and related statistics +% +% [...] = kappa(d1,d2); +% NaN's are handled as missing values and are ignored +% [...] = kappa(d1,d2,'notIgnoreNAN'); +% NaN's are handled as just another Label. +% [kap,sd,H,z,ACC,sACC,MI] = kappa(...); +% X = kappa(...); +% +% d1 data of scorer 1 +% d2 data of scorer 2 +% +% kap Cohen's kappa coefficient point +% se standard error of the kappa estimate +% H Concordance matrix, i.e. confusion matrix +% z zscore +% ACC overall agreement (accuracy) +% sACC specific accuracy +% MI Mutual information or transfer information (in [bits]) +% X is a struct containing all the fields above +% +% Reference(s): +% [1] Cohen, J. (1960). A coefficient of agreement for nominal scales. Educational and Psychological Measurement, 20, 3746. +% [2] J Bortz, GA Lienert (1998) Kurzgefasste Statistik fr die klassische Forschung, Springer Berlin  Heidelberg. +% Kapitel 6: Uebereinstimmungsmasze fuer subjektive Merkmalsurteile. p. 265270. +% [3] http://www.cmis.csiro.au/Fiona.Evans/personal/msc/html/chapter3.html +% [4] Kraemer, H. C. (1982). Kappa coefficient. In S. Kotz and N. L. Johnson (Eds.), +% Encyclopedia of Statistical Sciences. New York: John Wiley & Sons. +% [5] http://ourworld.compuserve.com/homepages/jsuebersax/kappa.htm +% +% + +% $Id: kappa.m 2141 20090702 12:05:29Z schloegl $ +% Copyright (c) 19972006,2008,2009 by Alois Schloegl <a.schloegl@...> +% This function is part of the NaNtoolbox +% http://hci.tugraz.ac.at/~schloegl/matlab/NaN/ +% +% BioSig is free software: you can redistribute it and/or modify +% it under the terms of the GNU General Public License as published by +% the Free Software Foundation, either version 3 of the License, or +% (at your option) any later version. +% +% BioSig is distributed in the hope that it will be useful, +% but WITHOUT ANY WARRANTY; without even the implied warranty of +% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +% GNU General Public License for more details. +% +% You should have received a copy of the GNU General Public License +% along with BioSig. If not, see <http://www.gnu.org/licenses/>;. + + +mode.ignoreNAN = 1; +kk = []; +if nargin>2 + if ischar(arg3) + if strcmpi(arg3,'notIgnoreNAN') + mode.ignoreNAN = 0; + end + else + kk = arg3; + end +end; +if nargin<4 + w = []; +end; + +if nargin>1, + d = d(:); + c = c(:); + + tmp = [d;c]; + maxCLASS = max(tmp); + tmp(isnan(tmp)) = maxCLASS+1; + [X.Label,i,j] = unique(tmp); + c = j(1+numel(d):end); + d = j(1:numel(d)); + + if mode.ignoreNAN, + if any(tmp>maxCLASS) +% fprintf(2,'Warning KAPPA: some elements are NaN. These are handled as missing values and are ignored.\n'); +% fprintf(2,'If NaN should be handled as just another label, use kappa(..,''notIgnoreNaN'').\n'); + ix = find(c<=maxCLASS & d<=maxCLASS); + d = d(ix); c=c(ix); + if ~isempty(w) w = w(ix); end; + end; + X.Label(X.Label>maxCLASS) = []; + else + X.Label(X.Label>maxCLASS) = NaN; + end; + + N = length(d); + ku = max([d;c]); % upper range + kl = min([d;c]); % lower range + if isempty(w) + w = ones(N,1); + end; + + if isempty(kk), + kk = length(X.Label); % maximum element + else + if kk<ku; % maximum element + fprintf(2,'Error KAPPA: some element is larger than arg3(%i)\n',kk); + end; + end; + + if 0, + h = histo([d+c*kk; kk*kk+1; 1]); + H = reshape(h(1:length(h)1)); + H(1,1) = H(1,1)1; + else + if 1; % exist('OCTAVE_VERSION')>=5; + H = zeros(kk); + for k = 1:N, + if ~isnan(d(k)) & ~isnan(c(k)), + H(d(k),c(k)) = H(d(k),c(k)) + w(k); + end; + end; + elseif isempty(w) + H = full(sparse(d(1:N),c(1:N),1,kk,kk)); + else + H = full(sparse(d(1:N),c(1:N),w(1:N),kk,kk)); + end; + end; +else + X.Label = 1:min(size(d)); + H = d(X.Label,X.Label); +end; +s = warning; +warning('off'); + +N = sum(H(:)); +p0 = sum(diag(H))/N; %accuracy of observed agreement, overall agreement +%OA = sum(diag(H))/N); + +p_i = sum(H); %sum(H,1); +pi_ = sum(H'); %sum(H,2)'; + +SA = 2*diag(H)'./(p_i+pi_); % specific agreement + +pe = (p_i*pi_')/(N*N); % estimate of change agreement + +px = sum(p_i.*pi_.*(p_i+pi_))/(N*N*N); + +%standard error +kap = (p0pe)/(1pe); +sd = sqrt((pe+pe*pepx)/(N*(1pe*pe))); + +%standard error +se = sqrt((p0+pe*pepx)/N)/(1pe); +if ~isreal(se) + z = NaN; +end +z = kap/se; +warning(s); + +if ((1 < nargout) & (nargout<7)) return; end; + +% Nykopp's entropy +pwi = sum(H,2)/N; % p(x_i) +pwj = sum(H,1)/N; % p(y_j) +pji = H./repmat(sum(H,2),1,size(H,2)); % p(y_j  x_i) +R =  sumskipnan(pwj.*log2(pwj)) + sumskipnan(pwi'*(pji.*log2(pji))); + +if (nargout>1) return; end; + +X.kappa = kap; +X.kappa_se = se; +X.H = H; +X.z = z; +X.ACC = p0; +X.sACC = SA; +X.MI = R; + +if length(H)==2, + X.FNR = H(2,1)/sum(H(2,:)); + X.FPR = H(1,2)/sum(H(1,:)); + X.TPR = H(2,2)/sum(H(2,:)); +end; + +kap = X; + Property changes on: trunk/octaveforge/extra/NaN/inst/kappa.m ___________________________________________________________________ Added: Id + test_sc.m Added: trunk/octaveforge/extra/NaN/inst/test_sc.m ===================================================================  trunk/octaveforge/extra/NaN/inst/test_sc.m (rev 0) +++ trunk/octaveforge/extra/NaN/inst/test_sc.m 20090702 12:27:35 UTC (rev 5985) @@ 0,0 +1,287 @@ +function [R]=test_sc(CC,D,mode,classlabel) +% TEST_SC: apply statistical and SVM classifier to test data +% +% R = test_sc(CC,D,TYPE [,target_Classlabel]) +% R.output output distance for each class +% R.classlabel class for output data +% The target class is optional. If it is provided, the following values are returned. +% R.kappa Cohen's kappa coefficient +% R.ACC Classification accuracy +% R.H Confusion matrix +% +% The classifier CC is typically obtained by TRAIN_SC. If a statistical +% classifier is used, TYPE can be used to modify the classifier. +% TYPE = 'MDA' mahalanobis distance based classifier +% TYPE = 'MD2' mahalanobis distance based classifier +% TYPE = 'MD3' mahalanobis distance based classifier +% TYPE = 'GRB' Gaussian radial basis function +% TYPE = 'QDA' quadratic discriminant analysis +% TYPE = 'LD2' linear discriminant analysis (see LDBC2) +% TYPE = 'LD3' linear discriminant analysis (see LDBC3) +% TYPE = 'LD4' linear discriminant analysis (see LDBC4) +% TYPE = 'GDBC' general distance based classifier +% +% see also: TRAIN_SC +% +% References: +% [1] R. Duda, P. Hart, and D. Stork, Pattern Classification, second ed. +% John Wiley & Sons, 2001. + +% $Id: test_sc.m 2140 20090702 12:03:55Z schloegl $ +% Copyright (C) 2005,2006,2008,2009 by Alois Schloegl <a.schloegl@...> +% This function is part of the NaNtoolbox +% http://hci.tugraz.ac.at/~schloegl/matlab/NaN/ + +% This program is free software; you can redistribute it and/or +% modify it under the terms of the GNU General Public License +% as published by the Free Software Foundation; either version 3 +% of the License, or (at your option) any later version. +% +% This program is distributed in the hope that it will be useful, +% but WITHOUT ANY WARRANTY; without even the implied warranty of +% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +% GNU General Public License for more details. +% +% You should have received a copy of the GNU General Public License +% along with this program; if not, write to the Free Software +% Foundation, Inc., 59 Temple Place  Suite 330, Boston, MA 021111307, USA. + +if nargin<3, + mode = []; +end; +[t1,t] = strtok(CC.datatype,':'); +[t2,t] = strtok(t,':'); +[t3,t] = strtok(t,':'); +if ~strcmp(t1,'classifier'), return; end; + +if isfield(CC,'prewhite') + D = D*CC.prewhite(2:end,:) + CC.prewhite(ones(size(D,1),1),:); + CC = rmfield(CC,'prewhite'); +end; + +POS1 = [strfind(CC.datatype,'/gsvd'),strfind(CC.datatype,'/sparse')]; + +if 0, + + +elseif strcmp(CC.datatype,'classifier:nbpw') + error('NBPW not implemented yet') + %%%% Naive Bayesian Parzen Window Classifier %%%% + d = repmat(NaN,size(D,1),size(CC.MEAN,1)); + for k = 1:size(CC.MEAN,1) + z = (D  CC.MEAN(repmat(k,size(D,1),1),:)).^2 ./ (CC.VAR(repmat(k,size(D,1),1),:)); + z = z + log(CC.VAR(repmat(k,size(D,1),1),:)); % + log(2*pi); + d(:,k) = sum(z/2, 2) + log(mean(CC.N(k,:))); + end; + d = exp(dlog(mean(sum(CC.N,1)))log(2*pi)/2); + + +elseif strcmp(CC.datatype,'classifier:nbc') + %%%% Naive Bayesian Classifier %%%% + d = repmat(NaN,size(D,1),size(CC.MEAN,1)); + for k = 1:size(CC.MEAN,1) + z = (D  CC.MEAN(repmat(k,size(D,1),1),:)).^2 ./ (CC.VAR(repmat(k,size(D,1),1),:)); + z = z + log(CC.VAR(repmat(k,size(D,1),1),:)); % + log(2*pi); + d(:,k) = sum(z/2, 2) + log(mean(CC.N(k,:))); + end; + d = exp(dlog(mean(sum(CC.N,1)))log(2*pi)/2); + + +elseif strcmp(CC.datatype,'classifier:anbc') + %%%% Augmented Naive Bayesian Classifier %%%% + d = repmat(NaN,size(D,1),size(CC.MEAN,1)); + for k = 1:size(CC.MEAN,1) + z = (D*CC.V  CC.MEAN(repmat(k,size(D,1),1),:)).^2 ./ (CC.VAR(repmat(k,size(D,1),1),:)); + z = z + log(CC.VAR(repmat(k,size(D,1),1),:)); % + log(2*pi); + d(:,k) = sum(z/2, 2) + log(mean(CC.N(k,:))); + end; + d = exp(dlog(mean(sum(CC.N,1)))log(2*pi)/2); + + +elseif strcmp(CC.datatype,'classifier:statistical:rda') + % Friedman (1989) Regularized Discriminant analysis + if isfield(CC,'hyperparameters') && isfield(CC.hyperparameters,'lambda') && isfield(CC.hyperparameters,'gamma') + D = [ones(size(D,1),1),D]; % add 1column + lambda = CC.hyperparameters.lambda; + gamma = CC.hyperparameters.gamma; + d = repmat(NaN,size(D,1),size(CC.MD,1)); + ECM = CC.MD./CC.NN; + NC = size(ECM); + ECM0 = squeeze(sum(ECM,3)); %decompose ECM + [M0,sd,COV0,xc,N] = decovm(ECM0); + for k = 1:NC(3); + [M,sd,s,xc,N] = decovm(squeeze(ECM(:,:,k))); + s = ((1lambda)*N*s+lambda*COV0)/((1lambda)*N+lambda); + s = (1gamma)*s+gamma*(trace(s))/(NC(2)1)*eye(NC(2)1); + ir = [M;eye(NC(2)1)]*inv(s)*[M',eye(NC(2)1)]; % inverse correlation matrix extended by mean + d(:,k) = sum((D*ir).*D,2); % calculate distance of each data point to each class + end; + else + error('QDA: hyperparamters lambda and/or gamma not defined') + end; + + + +elseif strcmp(CC.datatype,'classifier:csp') + d = (D*CC.csp_w).^2; + d = filtfilt(CC.FiltB,CC.FiltA,(D*CC.csp_w).^2); + R = test_sc(CC.CSP,log(d)); % LDA classifier of + d = R.output; + cl= R.classlabel; + + +elseif strcmp(CC.datatype,'classifier:svm:lib:1vs1')  strcmp(CC.datatype,'classifier:svm:lib:rbf'); + + [cl, accuracy] = svmpredict(classlabel, D, CC.model); %Use the classifier + + %Create a pseudo tsd matrix for bci4eval + d = zeros(size(cl,1), CC.model.nr_class); + for i = 1:size(cl,1) + d(i,cl(i)) = 1; + end + + +elseif isfield(CC,'weights'); %strcmpi(t2,'svm')  (strcmpi(t2,'statistical') & strncmpi(t3,'ld',2)) ; + + % linear classifiers like: LDA, SVM, LPM + %d = [ones(size(D,1),1), D] * CC.weights; + d = repmat(NaN,size(D,1),size(CC.weights,2)); + for k = 1:size(CC.weights,2), + d(:,k) = D * CC.weights(2:end,k) + CC.weights(1,k); + end; + if size(CC.weights,2)==1, + d = [d, d]; + end; + + +elseif ~isempty(POS1) % GSVD & sparse + CC.datatype = CC.datatype(1:POS1(1)1); + r = test_sc(CC,D*CC.G); + d = r.output; + + +elseif strcmp(t2,'statistical'); + if isempty(mode) + mode.TYPE = upper(t3); + end; + D = [ones(size(D,1),1),D]; % add 1column + + if 0, + elseif strcmpi(mode.TYPE,'LD2'), + %d = ldbc2(CC,D); + ECM = CC.MD./CC.NN; + NC = size(ECM); + ECM0 = squeeze(sum(ECM,3)); %decompose ECM + [M0,sd,COV0,xc,N] = decovm(ECM0); + for k = 1:NC(3); + ecm = squeeze(ECM(:,:,k)); + [M1,sd,COV1,xc,N] = decovm(ECM0ecm); + [M2,sd,COV2,xc,N] = decovm(ecm); + w = (COV1+COV2)\(M2'M1')*2; + w0 = M0*w; + W(:,k) = [w0; w]; + end; + d = D*W; + elseif strcmpi(mode.TYPE,'LD3'); + %d = ldbc3(CC,D); + ECM = CC.MD./CC.NN; + NC = size(ECM); + ECM0 = squeeze(sum(ECM,3)); %decompose ECM + [M0,sd,COV0,xc,N] = decovm(ECM0); + for k = 1:NC(3); + ecm = squeeze(ECM(:,:,k)); + [M1,sd,COV1,xc,N] = decovm(ECM0ecm); + [M2,sd,COV2,xc,N] = decovm(ecm); + w = COV0\(M2'M1')*2; + w0 = M0*w; + W(:,k) = [w0; w]; + end; + d = D*W; + elseif strcmpi(mode.TYPE,'LD4'); + %d = ldbc4(CC,D); + ECM = CC.MD./CC.NN; + NC = size(ECM); + ECM0 = squeeze(sum(ECM,3)); %decompose ECM + [M0,sd,COV0,xc,N] = decovm(ECM0); + for k = 1:NC(3); + ecm = squeeze(ECM(:,:,k)); + [M1,sd,COV1,xc,N1] = decovm(ECM0ecm); + [M2,sd,COV2,xc,N2] = decovm(ecm); + w = (COV1*N1+COV2*N2)\((M2'M1')*(N1+N2)); + w0 = M0*w; + W(:,k) = [w0; w]; + end; + d = D*W; + elseif strcmpi(mode.TYPE,'MDA'); + for k = 1:length(CC.IR); + d(:,k) = sum((D*CC.IR{k}).*D,2); % calculate distance of each data point to each class + end; + elseif strcmpi(mode.TYPE,'MD2'); + for k = 1:length(CC.IR); + d(:,k) = sum((D*CC.IR{k}).*D,2); % calculate distance of each data point to each class + end; + d = sqrt(d); + elseif strcmpi(mode.TYPE,'GDBC'); + for k = 1:length(CC.IR); + d(:,k) = sum((D*CC.IR{k}).*D,2) + CC.logSF7(k); % calculate distance of each data point to each class + end; + d = exp(d/2); + elseif strcmpi(mode.TYPE,'MD3'); + for k = 1:length(CC.IR); + d(:,k) = sum((D*CC.IR{k}).*D,2) + CC.logSF7(k); % calculate distance of each data point to each class + end; + d = exp(d/2); + d = d./repmat(sum(d,2),1,size(d,2)); % Zuordungswahrscheinlichkeit [1], p.601, equ (18.39) + elseif strcmpi(mode.TYPE,'QDA'); + for k = 1:length(CC.IR); + % [1] (18.33) QCF  quadratic classification function + d(:,k) = (sum((D*CC.IR{k}).*D,2)  CC.logSF5(k)); + end; + elseif strcmpi(mode.TYPE,'QDA2'); + r = sum(CC.NN(:,1,1)); + r = r/(rlength(CC.IR)); + for k = 1:length(CC.IR); + % [1] (18.33) QCF  quadratic classification function + d(:,k) = (sum((D*(CC.IR{k})).*D,2) + CC.logSF4(k)); + end; + elseif strcmpi(mode.TYPE,'GRB'); % Gaussian RBF + for k = 1:length(CC.IR); + d(:,k) = sum((D*CC.IR{k}).*D,2); % calculate distance of each data point to each class + end; + d = exp(sqrt(d)/2); + elseif strcmpi(mode.TYPE,'GRB2'); % Gaussian RBF + for k = 1:length(CC.IR); + d(:,k) = sum((D*CC.IR{k}).*D,2); % calculate distance of each data point to each class + end; + d = exp(d); + elseif strcmpi(mode.TYPE,'MQU'); % Multiquadratic + for k = 1:length(CC.IR); + d(:,k) = sum((D*CC.IR{k}).*D,2); % calculate distance of each data point to each class + end; + d = sqrt(1+d); + elseif strcmpi(mode.TYPE,'IMQ'); % Inverse Multiquadratic + for k = 1:length(CC.IR); + d(:,k) = sum((D*CC.IR{k}).*D,2); % calculate distance of each data point to each class + end; + d = (1+d).^(1/2); + elseif strcmpi(mode.TYPE,'Cauchy'); % Cauchy RBF + for k = 1:length(CC.IR); + d(:,k) = sum((D*CC.IR{k}).*D,2); % calculate distance of each data point to each class + end; + d = 1./(1+d); + end; +else + fprintf(2,'Error TEST_SC: unknown classifier\n'); + return; +end; + +[tmp,cl] = max(d,[],2); +cl = CC.Labels(cl); +cl(isnan(tmp)) = NaN; + +R.output = d; +R.classlabel = cl; + +if nargin>3, + [R.kappa,R.sd,R.H,z,R.ACC] = kappa(classlabel(:),cl(:)); +end; Added: trunk/octaveforge/extra/NaN/inst/train_lda_sparse.m ===================================================================  trunk/octaveforge/extra/NaN/inst/train_lda_sparse.m (rev 0) +++ trunk/octaveforge/extra/NaN/inst/train_lda_sparse.m 20090702 12:27:35 UTC (rev 5985) @@ 0,0 +1,145 @@ +function [CC] = train_lda_sparse(X,G,par,tol) +% Linear Discriminant Analysis for the Small Sample Size Problem as described in +% Algorithm 1 of J. Duintjer Tebbens, P. Schlesinger: 'Improving +% Implementation of Linear Discriminant Analysis for the High Dimension/Small Sample Size +% Problem', Computational Statistics and Data Analysis, vol. 52, no. 1, pp. 423437, 2007. +% Input: +% X ...... (sparse) training data matrix +% G ...... group coding matrix of the training data +% test ...... (sparse) test data matrix +% Gtest ...... group coding matrix of the test data +% par ...... if par = 0 then classification exploits sparsity too +% tol ...... tolerance to distinguish zero eigenvalues +% Output: +% err ...... Wrong classification rate (in %) +% trafo ...... LDA transformation vectors +% +% Reference(s): +% J. Duintjer Tebbens, P. Schlesinger: 'Improving +% Implementation of Linear Discriminant Analysis for the High Dimension/Small Sample Size +% Problem', Computational Statistics and Data Analysis, vol. 52, no. 1, +% pp. 423437, 2007. +% +% Copyright (C) by J. Duintjer Tebbens, Institute of Computer Science of the Academy of Sciences of the Czech Republic, +% Pod Vodarenskou vezi 2, 182 07 Praha 8 Liben, 18.July.2006. +% This work was supported by the Program Information Society under project +% 1ET400300415. +% +% +% Modified for the use with Matlab6.5 by A. Schl\xF6gl, 22.Aug.2006 +% +% $Id: train_lda_sparse.m,v 1.7 20071011 09:39:39 schloegl Exp $ +% This function is part of the NaNtoolbox +% http://hci.tugraz.ac.at/~schloegl/matlab/NaN/ + +% This program is free software; you can redistribute it and/or +% modify it under the terms of the GNU General Public License +% as published by the Free Software Foundation; either version 3 +% of the License, or (at your option) any later version. +% +% This program is distributed in the hope that it will be useful, +% but WITHOUT ANY WARRANTY; without even the implied warranty of +% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +% GNU General Public License for more details. +% +% You should have received a copy of the GNU General Public License +% along with this program; if not, write to the Free Software +% Foundation, Inc., 59 Temple Place  Suite 330, Boston, MA 021111307, USA. + +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Step (1) +%p = length(X(1,:));n = length(X(:,1));g = length(G(1,:)); +G = sparse(G); +[n,p]=size(X); +g = size(G,2); + +for j=1:g + nj(j) = norm(G(:,j))^2; +end +Dtild = spdiags(nj'.^(1),[0],g,g); +Xtild = X*X'; +Xtild1 = Xtild*ones(n,1); +help = ones(n,1)*Xtild1'/n  (ones(1,n)*Xtild'*ones(n,1))/(n^2); +matrix = Xtild  Xtild1*ones(1,n)/n  help; +% eliminate nonsymmetry of matrix due to rounding error: +matrix = (matrix+matrix')/2; +[V0,S] = eig(matrix); +% [s,I] = sort(diag(S),'descend'); +[s,I] = sort(diag(S)); s = s; + +cc = sum(s<tol); + +count = ncc; +V1 = V0(:,I(1:count)); +D1inv = diag(s(1:count).^(1.0)); +Dhalfinv = diag(s(1:count).^(0.5)); +Dhalf = diag(s(1:count).^(0.5)); +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Step (2) +help2 = V1*D1inv; +M1 = Dtild*G'*Xtild; +B1 = (G*(M1*(speye(n)1/n))help)*help2; +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Step (3) +opts.issym = 1;opts.isreal = 1;opts.disp = 0; +%if 0, +try, + [V0,S,flag] = eigs(B1'*B1,g1,'lm',opts); + EV = Dhalfinv*V0; + [s,I] = sort(diag(S)); s = s; + %else +catch + % needed as long as eigs is not supported by Octave + [V0,S] = eig(B1'*B1); + flag = 0; + [s,I] = sort(diag(S)); s = s(I(1:g1)); + EV = Dhalfinv * V0(:,I(1:g1)); + I = 1:g1; +end; +%EV = Dhalfinv*V0; +%[s,I] = sort((diag(S)),'descend'); +%[s,I] = sort(diag(S)); s = s; +if flag ~= 0 + 'eigs did not converge' +end +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Step (4) +for j=1:g1, + C(:,j) = EV(:,I(j))/norm(EV(:,I(j))); +end +cc = 0; +for j=1:g1, + if (1s(j))<tol + cc = cc+1; + V2(:,j) = EV(:,I(j)); + else + break + end +end +if cc > 0 + [Q,R] = qr(V2,0); + matrix = B1*Dhalf*Q; + [V0,S] = eig(matrix'*matrix); + %[s,I] = sort(diag(S),'descend'); + [s,I] = sort(diag(S)); s = s; + for j=1:cc + C(:,j) = Q*V0(:,I(j)); + end +end + +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Step (5) +C1 = help2*Dhalf*C; +trafo(:,1:g1) = X'*C1  (X'*ones(n,1))*(ones(1,n)*C1/n); +for j=1:g1 + trafo(:,j) = trafo(:,j)/norm(trafo(:,j)); +end +CC.trafo = trafo; + +if par == 0 +% X2 = full(test*X'); +% [pred] = classifs(C1,M1,X2); + CC.C1 = C1; + CC.M1 = M1; + CC.X = X; +else +% M = Dtild*G'*X; +% [pred] = classifs(trafo,M,test); + CC.C1 = trafo; + CC.M1 = Dtild*G'*X; +end Property changes on: trunk/octaveforge/extra/NaN/inst/train_lda_sparse.m ___________________________________________________________________ Added: Id + test_sc.m Added: trunk/octaveforge/extra/NaN/inst/train_sc.m ===================================================================  trunk/octaveforge/extra/NaN/inst/train_sc.m (rev 0) +++ trunk/octaveforge/extra/NaN/inst/train_sc.m 20090702 12:27:35 UTC (rev 5985) @@ 0,0 +1,677 @@ +function [CC]=train_sc(D,classlabel,MODE,W) +% Train a (statistical) classifier +% +% CC = train_sc(D,classlabel) +% CC = train_sc(D,classlabel,MODE) +% CC = train_sc(D,classlabel, 'REG', W) +% weighting D(k,:) with weight W(k) +% +% CC contains the model parameters of a classifier which can be applied +% to test data using test_sc. +% R = test_sc(CC,D,...) +% +% The following classifier types are supported MODE.TYPE +% 'MDA' mahalanobis distance based classifier [1] +% 'MD2' mahalanobis distance based classifier [1] +% 'MD3' mahalanobis distance based classifier [1] +% 'GRB' Gaussian radial basis function [1] +% 'QDA' quadratic discriminant analysis [1] +% 'LD2' linear discriminant analysis (see LDBC2) [1] +% MODE.hyperparameter.gamma: regularization parameter [default 0] +% 'LD3' linear discriminant analysis (see LDBC3) [1] +% MODE.hyperparameter.gamma: regularization parameter [default 0] +% 'LD4' linear discriminant analysis (see LDBC4) [1] +% MODE.hyperparameter.gamma: regularization parameter [default 0] +% 'LD5' another LDA (motivated by CSP) +% MODE.hyperparameter.gamma: regularization parameter [default 0] +% 'RDA' regularized discriminant analysis [7] +% MODE.hyperparameter.gamma: regularization parameter +% MODE.hyperparameter.lambda = +% gamma = 0, lambda = 0 : MDA +% gamma = 0, lambda = 1 : LDA +% Hint: hyperparameters are used only in test_sc.m, testing different +% the hyperparameters do not need repetitive calls to train_sc, +% it is sufficient to modify CC.hyperparameters before calling test_sc. +% 'GDBC' general distance based classifier [1] +% '' statistical classifier, requires Mode argument in TEST_SC +% '###/GSVD' GSVD and statistical classifier [2,3], +% '###/sparse' sparse [5] +% '###' must be 'LDA' or any other classifier +% 'SVM','SVM1r' support vector machines, onevsrest +% MODE.hyperparameter.c_value = +% 'PSVM' Proximal SVM [8] +% MODE.hyperparameter.nu (default: 1.0) +% 'PLS' (linear) partial least squares regression +% 'REG' regression analysis; +% 'WienerHopf' WienerHopf equation +% 'NBC' Naive Bayesian Classifier [6] +% 'aNBC' Augmented Naive Bayesian Classifier [6] +% 'NBPW' Naive Bayesian Parzen Window [9] +% 'SVM11' support vector machines, onevsone + voting +% MODE.hyperparameter.c_value = +% 'RBF' Support Vector Machines with RBF Kernel +% MODE.hyperparameter.c_value = +% MODE.hyperparameter.gamma = +% 'LPM' Linear Programming Machine +% MODE.hyperparameter.c_value = +% 'CSP' CommonSpatialPattern is very experimental and just a hack +% uses a smoothing window of 50 samples. +% +% {'MDA','MD2','LD2','LD3','LD4','LD5','LD6','NBC','aNBC','WienerHopf','REG','LDA/GSVD','MDA/GSVD', 'LDA/sparse','MDA/sparse','RDA','GDBC','SVM','RBF'} +% +% CC contains the model parameters of a classifier. Some time ago, +% CC was a statistical classifier containing the mean +% and the covariance of the data of each class (encoded in the +% socalled "extended covariance matrices". Nowadays, also other +% classifiers are supported. +% +% see also: TEST_SC, COVM +% +% References: +% [1] R. Duda, P. Hart, and D. Stork, Pattern Classification, second ed. +% John Wiley & Sons, 2001. +% [2] Peg Howland and Haesun Park, +% Generalizing Discriminant Analysis Using the Generalized Singular Value Decomposition +% IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(8), 2004. +% dx.doi.org/10.1109/TPAMI.2004.46 +% [3] http://wwwstatic.cc.gatech.edu/~kihwan23/face_recog_gsvd.htm +% [4] Jieping Ye, Ravi Janardan, Cheong Hee Park, Haesun Park +% A new optimization criterion for generalized discriminant analysis on undersampled problems. +% The Third IEEE International Conference on Data Mining, Melbourne, Florida, USA +% November 19  22, 2003 +% [5] J.D. Tebbens and P. Schlesinger (2006), +% Improving Implementation of Linear Discriminant Analysis for the Small Sample Size Problem +% Computational Statistics & Data Analysis, vol 52(1): 423437, 2007 +% http://www.cs.cas.cz/mweb/download/publi/JdtSchl2006.pdf +% [6] H. Zhang, The optimality of Naive Bayes, +% http://www.cs.unb.ca/profs/hzhang/publications/FLAIRS04ZhangH.pdf +% [7] J.H. Friedman. Regularized discriminant analysis. +% Journal of the American Statistical Association, 84:165–175, 1989. +% [8] G. Fung and O.L. Mangasarian, Proximal Support Vector Machine Classifiers, KDD 2001. +% Eds. F. Provost and R. Srikant, Proc. KDD2001: Knowledge Discovery and Data Mining, August 2629, 2001, San Francisco, CA. +% p. 7786. +% [9] Kai Keng Ang, Zhang Yang Chin, Haihong Zhang, Cuntai Guan. +% Filter Bank Common Spatial Pattern (FBCSP) in BrainComputer Interface. +% IEEE International Joint Conference on Neural Networks, 2008. IJCNN 2008. (IEEE World Congress on Computational Intelligence). +% 18 June 2008 Page(s):2390  2397 + + +% $Id: train_sc.m 2140 20090702 12:03:55Z schloegl $ +% Copyright (C) 2005,2006,2007,2008,2009 by Alois Schloegl <a.schloegl@...> +% This function is part of the NaNtoolbox +% http://hci.tugraz.ac.at/~schloegl/matlab/NaN/ + +% This program is free software; you can redistribute it and/or +% modify it under the terms of the GNU General Public License +% as published by the Free Software Foundation; either version 2 +% of the License, or (at your option) any later version. +% +% This program is distributed in the hope that it will be useful, +% but WITHOUT ANY WARRANTY; without even the implied warranty of +% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +% GNU General Public License for more details. +% +% You should have received a copy of the GNU General Public License +% along with this program; if not, write to the Free Software +% Foundation, Inc., 59 Temple Place  Suite 330, Boston, MA 021111307, USA. + +if nargin<3, MODE = 'LDA'; end; +if nargin<4, W = []; end; +if ischar(MODE) + tmp = MODE; + clear MODE; + MODE.TYPE = tmp; +elseif ~isfield(MODE,'TYPE') + MODE.TYPE=''; +end; + +sz = size(D); +if sz(1)~=length(classlabel), + error('length of data and classlabel does not fit'); +end; + +%CC.Labels = unique(classlabel); +CC.Labels = 1:max(classlabel); + +% remove all NaN's +if 1, + % several classifier can deal with NaN's, there is no need to remove them. +elseif isempty(W) + %% TODO: some classifiers can deal with NaN's in D. Test whether this can be relaxed. + %ix = any(isnan([classlabel]),2); + ix = any(isnan([D,classlabel]),2); + D(ix,:)=[]; + classlabel(ix,:)=[]; + W = []; +else + %ix = any(isnan([classlabel]),2); + ix = any(isnan([D,classlabel]),2); + D(ix,:)=[]; + classlabel(ix,:)=[]; + W(ix,:)=[]; + warning('support for weighting of samples is still experimental'); +end; + +sz = size(D); +if sz(1)~=length(classlabel), + error('length of data and classlabel does not fit'); +end; +if ~isfield(MODE,'hyperparameter') + MODE.hyperparameter = []; +end + + +if 0, + +elseif ~isempty(strfind(lower(MODE.TYPE),'nbpw')) + error('NBPW not implemented yet') + %%%% Naive Bayesian Parzen Window Classifier. + for k = 1:length(CC.Labels), + [d,CC.MEAN(k,:)] = center(D(classlabel==CC.Labels(k),:),1); + [CC.VAR(k,:),CC.N(k,:)] = sumskipnan(d.^2,1); + h2_opt = (4./(3*CC.N(k,:))).^(2/5).*CC.VAR(k,:); + %%% TODO + end; + + +elseif ~isempty(strfind(lower(MODE.TYPE),'nbc')) + %%%% Naive Bayesian Classifier. + if ~isempty(strfind(lower(MODE.TYPE),'anbc')) + %%%% Augmented Naive Bayesian classifier. + [CC.V,L] = eig(covm(D,'M',W)); + D = D*CC.V; + else + CC.V = eye(size(D,2)); + end; + for k = 1:length(CC.Labels), + ix = classlabel==CC.Labels(k); + %% [d,CC.MEAN(k,:)] = center(D(ix,:),1); + if ~isempty(W) + [s,n] = sumskipnan(D(ix,:),1,W(ix)); + CC.MEAN(k,:) = s./n; + d = D(ix,:)  CC.MEAN(repmat(k,sum(ix),1),:); + [CC.VAR(k,:),CC.N(k,:)] = sumskipnan(d.^2,1,W(ix)); + else + [s,n] = sumskipnan(D(ix,:),1); + CC.MEAN(k,:) = s./n; + d = D(ix,:)  CC.MEAN(repmat(k,sum(ix),1),:); + [CC.VAR(k,:),CC.N(k,:)] = sumskipnan(d.^2,1); + end + end; + CC.VAR = CC.VAR./max(CC.N1,0); + CC.datatype = ['classifier:',lower(MODE.TYPE)]; + + +elseif ~isempty(strfind(lower(MODE.TYPE),'lpm')) + if ~isempty(W) + error(sprintf('Error TRAIN_SC: Classifier (%s) does not support weighted samples.',MODE.TYPE)); + end; + % linear programming machine + % CPLEX optimizer: ILOG solver, ilog cplex 6.5 reference manual http://www.ilog.com + MODE.TYPE = 'LPM'; + if ~isfield(MODE.hyperparameter,'c_value') + MODE.hyperparameter.c_value = 1; + end + + M = length(CC.Labels); + if M==2, M=1; end; % For a 2class problem, only 1 Discriminant is needed + for k = 1:M, + %LPM = train_LPM(D,(classlabel==CC.Labels(k)),'C',MODE.hyperparameter.c_value); + LPM = train_LPM(D',(classlabel'==CC.Labels(k))); + CC.weights(:,k) = [LPM.b; LPM.w(:)]; + end; + CC.hyperparameter.c_value = MODE.hyperparameter.c_value; + CC.datatype = ['classifier:',lower(MODE.TYPE)]; + + +elseif ~isempty(strfind(lower(MODE.TYPE),'pls'))  ~isempty(strfind(lower(MODE.TYPE),'reg')) + % 4th version: support for weighted samples  work well with unequally distributed data: + % regression analysis, can handle sparse data, too. + + M = length(CC.Labels); + + if nargin<4, + W = []; + end; + wD = [ones(size(D,1),1),D]; + + if isempty(W) + W = 1; + else + %% wD = diag(W)*wD + W = W(:); + for k=1:size(wD,2) + wD(:,k) = W.*wD(:,k); + end; + end; + + [q,r] = qr(wD,0); + CC.weights = repmat(NaN,sz(2)+1,M); + for k = 1:M, + ix = 2*(classlabel==CC.Labels(k))  1; + CC.weights(:,k) = r\(q'*(W.*ix)); + end; + CC.datatype = ['classifier:statistical:',lower(MODE.TYPE)]; + + +elseif ~isempty(strfind(MODE.TYPE,'WienerHopf')) + % Q: equivalent to LDA + % equivalent to Regression, except regression can not deal with NaN's + M = length(CC.Labels); + %if M==2, M==1; end; + CC.weights = repmat(NaN,size(D,2)+1,M); + cc = covm(D,'E',W); + c1 = classlabel(~isnan(classlabel)); + c2 = ones(sum(~isnan(classlabel)),M); + for k = 1:M, + c2(:,k) = c1==CC.Labels(k); + end; + CC.weights = cc\covm([ones(size(c2,1),1),D(~isnan(classlabel),:)],2*real(c2)1,'M',W); + CC.datatype = ['classifier:statistical:',lower(MODE.TYPE)]; + + +elseif ~isempty(strfind(MODE.TYPE,'WienerHopf')) + % Q: equivalent to LDA, Regression? + M = length(CC.Labels); + %if M==2, M==1; end; + CC.weights = repmat(NaN,size(D,2)+1,M); + cc = covm(D,'E',W); + for k = 1:M, + w = cc\covm([ones(sz(1),1),D],real(classlabel==CC.Labels(k)),'M',W); + CC.weights(:,k) = w; + end; + CC.datatype = ['classifier:statistical:',lower(MODE.TYPE)]; + + +elseif ~isempty(strfind(MODE.TYPE,'WienerHopf')) + %% OBSOLETE ??? + % Q: equivalent to LDA, Regression? + M = length(CC.Labels); + %if M==2, M==1; end; + CC.weights = repmat(NaN,size(D,2)+1,M); + for k = 1:M, + ix = ~any(isnan([classlabel,D]),2); + w = covm(D(ix,:),'E')\covm([ones(sum(ix),1),D(ix,:)],(classlabel(ix,:)==CC.Labels(k)),'M'); + CC.weights(:,k) = w; + end; + CC.datatype = ['classifier:statistical:',lower(MODE.TYPE)]; + + +elseif ~isempty(strfind(lower(MODE.TYPE),'/gsvd')) + if ~isempty(W) + error(sprintf('Error TRAIN_SC: Classifier (%s) does not support weighted samples.',MODE.TYPE)); + end; + % [2] Peg Howland and Haesun Park, 2004. + % Generalizing Discriminant Analysis Using the Generalized Singular Value Decomposition + % IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(8), 2004. + % dx.doi.org/10.1109/TPAMI.2004.46 + % [3] http://wwwstatic.cc.gatech.edu/~kihwan23/face_recog_gsvd.htm + + Hw = zeros(size(D)+[length(CC.Labels),0]); + Hb = []; + m0 = mean(D); + K = length(CC.Labels); + for k = 1:K, + ix = find(classlabel==CC.Labels(k)); + N(k) = length(ix); + [Hw(ix,:), mu] = center(D(ix,:)); + %Hb(k,:) = sqrt(N(k))*(mu(k,:)m0); + Hw(size(D,1)+k,:) = sqrt(N(k))*(mum0); % Hb(k,:) + end; + try + [P,R,Q] = svd(Hw,'econ'); + catch % needed because SVD(..,'econ') not supported in Matlab 6.x + [P,R,Q] = svd(Hw,0); + end; + t = rank(R); + + clear Hw Hb mu; + %[size(D);size(P);size(Q);size(R)] + R = R(1:t,1:t); + %P = P(1:size(D,1),1:t); + %Q = Q(1:t,:); + [U,E,W] = svd(P(1:size(D,1),1:t),0); + %[size(U);size(E);size(W)] + clear U E P; + %[size(Q);size(R);size(W)] + + %G = Q(1:t,:)'*[R\W']; + G = Q(:,1:t)*[R\W']; % this works as well and needs only 'econ'SVD + %G = G(:,1:t); % not needed + + % do not use this, gives very bad results for Medline database + %G = G(:,1:K); this seems to be a typo in [2] and [3]. + + CC = train_sc(D*G,classlabel,MODE.TYPE(1:find(MODE.TYPE=='/')1)); + CC.G = G; + if isfield(CC,'weights') + CC.weights = [CC.weights(1,:); G*CC.weights(2:end,:)]; + CC.datatype = ['classifier:statistical:',lower(MODE.TYPE)]; + else + CC.datatype = [CC.datatype,'/gsvd']; + end; + + +elseif ~isempty(strfind(lower(MODE.TYPE),'sparse')) + if ~isempty(W) + error(sprintf('Error TRAIN_SC: Classifier (%s) does not support weighted samples.',MODE.TYPE)); + end; + % [5] J.D. Tebbens and P.Schlesinger (2006), + % Improving Implementation of Linear Discriminant Analysis for the Small Sample Size Problem + % http://www.cs.cas.cz/mweb/download/publi/JdtSchl2006.pdf + + warning('sparse LDA is sensitive to linear transformations') + M = length(CC.Labels); + G = sparse([],[],[],size(D,1),M,size(D,1)); + for k = 1:M, + G(classlabel==CC.Labels(k),k) = 1; + end; + tol = 1e10; + + G = train_lda_sparse(D,G,1,tol); + CC.datatype = 'classifier:slda'; + POS1 = find(MODE.TYPE=='/'); + %G = v(:,1:size(G.trafo,2)).*G.trafo; + %CC.weights = s * CC.weights(2:end,:) + sparse(1,1:M,CC.weights(1,:),sz(2)+1,M); + G = G.trafo; + CC = train_sc(D*G,classlabel,MODE.TYPE(1:POS1(1)1)); + CC.G = G; + if isfield(CC,'weights') + CC.weights = [CC.weights(1,:); G*CC.weights(2:end,:)]; + CC.datatype = ['classifier:statistical:',lower(MODE.TYPE)]; + else + CC.datatype = [CC.datatype,'/sparse']; + end; + @@ Diff output truncated at 100000 characters. @@ This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 