HDTenEightyP/NetNews huggingface dataset:
From: eduardo@aramis.cs.ua.edu (Eduardo Kortright)
Newsgroups: comp.ai.neural-nets
Subject: Non-binary output Back Prop
Date: 31 Jul 92 18:06:18 GMT
Organization: Department of Computer Science, University of Alabama

I am currently trying to implement a BPN with outputs that do not
necessarily range between 0 and 1.  As the output function, I am using
the straight weighted sum of inputs instead of passing the sum through
a sigmoid function.  Also, when backpropagating the error, I use the
derivative of the output function (=1) instead of the derivative of
the sigmoid.  My problem is that unless the learning rate is
extremely small, everything blows up (the numbers get so large that I
get floating point overflows).  The NN thus takes forever to converge.

Is there anyone out there who has experience with this?  I have
temporarily gone back to using the sigmoid function and scaling the
output to the proper ranges.  If this question has been asked before
or not of interest to the group, please feel free to e-mail:

	eduardo@cs.ua.edu

Thanks in advance.

=-= Eduardo =-= eduardo@cs.ua.edu =-=
Eduardo Kortright // Grad student, University of Alabama at Tuscaloosa
-- 
=-= Eduardo =-= eduardo@cs.ua.edu =-=
From: stever@cse.ogi.edu (Steve Rehfuss)
Newsgroups: comp.ai.neural-nets
Subject: Re: Training classification with uneven categories
Date: 21 Jul 92 17:24:51 GMT
Article-I.D.: ogicse.40358
Distribution: world
Organization: Oregon Graduate Institute (formerly OGC), Beaverton, OR

In article <1992Jul9.060922.28633@iti.gov.sg>, cheekit@iti.gov.sg (Looi Chee Kit) writes:
|> We have been working on a neural network approach to bankruptcy prediction as 
|> a comparison with a statistical model constructed using probit analysis. A set
|> of 6 financial ratios comprises the set of independent variables for the model
|> (which is also the set of input variables for a 3-layer network using backprop
|> for training). Information from matched samples (i.e. 165 non-bankrupct 
|> companies and 165 bankrupct companies) are use for fitting the probit model. 
|> The real life proportions of bankrupct and non-bankrupct companies are 0.006
|> and 0.994. My question is: do we want to weigh the presentations of data for
|> bankrupct and non-bankrupct companies to reflect in some way the real-life
|> proportions (or the relative misclassification costs) when training the
|> neural network? When we trained our neural network using matched samples,
|> it was good for predicting bankruptcy cases while it was not perfect in
|> predicting the non-bankruptcy cases, resulting in an overall accuracy rate
|> (weighted) of less than 0.994 (0.994 is what we will get if we classify ANY
|> data as non-bankrupct). This issue seems to be relevant for applications
|> of neural networks to classification tasks where the real life proportion is
|> unevenly matched between the categories.
|> 
|> Any work done, ideas & suggestions, please reply via email to: 
|> cheekit@iti.gov.sg
|> 
|> ---
|> Chee-Kit LOOI    			| Internet: cheekit@iti.gov.sg
|> Knowledge Systems Lab			| Bitnet:   cheekit@itivax
|> Information Technology Institute	| Tel:      (65) 772-0926
|> National Computer Board of Singapore    | Fax:      (65) 770-3043

Look at Bourlard & Morgan, A Continuous Speech Recognition System Embedding MLP into HMM,
in NIPS, 1988 or 1989.  They divide the outputs by the prior class probabilities, then
choosing the max output corresponds to choosing the class that makes the data most likely.
Other people have done this too.   If you have enough data, an adequate architecture, and
train to MSE or cross-entropy (or various other error fns), and don't get stuck in a
local minimum, the outputs converge to p(class|inputs).  Dividing by prior class 
probabilities and doing winner-take-all gives you: 
                p(class|inputs)           p(inputs|class)
	argmax ----------------- = argmax --------------- = argmax p(inputs|class)
           c       p(class)           c      p(inputs)         c
Newsgroups: comp.ai.neural-nets
From: davids@eng.auburn.edu (David Schreibman)
Subject: Paper Needed
Reply-To: davids@eng.auburn.edu
Organization: Auburn University Engineering
Date: Fri, 24 Jul 1992 15:14:19 GMT

	I am doing research in the area of speech recognition with neural networks
and have found out about a paper that may have some important information.  Unfortunately, I am having trouble getting a copy.  The paper is:

M.W.H. Chong and F. Fallside, 'Classification and regression tree neural 
networks for automatic speech recognition,' in Proc. INNS-90, 187-190, Paris,
July 1990, IEEE.

I would gladly pay any costs associated with faxing me a copy of this paper.

If you can help, please fax to: David V. Schreibman
                                CSE Department
                                Auburn University
The number is: 205-844-2672

Thanks in advance to anyone who can help.

David (davids@eng.auburn.edu)
From: prechelt@i41s14.ira.uka.de (Lutz Prechelt)
Newsgroups: comp.ai.neural-nets
Subject: any complicated units/connections used ?
Date: 24 Jul 1992 13:11:20 GMT
Organization: University of Karlsruhe, FRG
Distribution: uka
NNTP-Posting-Host: i41s14.ira.uka.de

Hello netters,

in almost all neural network models used today, the connections are 
restricted to multipying their input with a weight and the units 
are restricted to applying a mapping function (e.g. threshold or 
squashing function) to their cumulated inputs.

I would like to know about all *more complicated* forms of units or
connections anybody is using or planning to use in a neural network.
I am aware of sigma-pi units, activation decay, and time delay 
connections.

Please reply by email, I'll summarize.

  Lutz

-- 
Lutz Prechelt   (email: prechelt@ira.uka.de)            | Whenever you 
Institut fuer Programmstrukturen und Datenorganisation  | complicate things,
Universitaet Karlsruhe;  D-7500 Karlsruhe 1;  Germany   | they get
(Voice: ++49/721/608-4317, FAX: ++49/721/694092)        | less simple.
Newsgroups: comp.ai.neural-nets
From: honavar@iastate.edu (Vasant G Honavar)
Subject: Re: Neural Nets and Brains
Organization: Brainstorms International
Date: Sat, 25 Jul 1992 03:11:26 GMT

In article <arms.711986585@spedden> arms@cs.UAlberta.CA (Bill Armstrong) writes:
>
>My point
>was that BP nets use continuous signals and the brain doesn't -- an
>obvious very significant difference.  I was asking why people would
>expect to understand the brain by studying a system (BP) that is
>*different* at the most basic level of signalling.
>
>Don't you agree that if the brain works on 0-1 signals, then to study
>the brain one could beneficially look at logical systems? 

I have no intention of getting involved in an extended argument on the
relative merits of BP v/s ALN v/s you-name-it. A young field like ours could
benefit from people studying as broad a range of models as possible.  

But I would like to point out that it is far from clear that the brain
works entirely on 0-1 signals.  The spikes are be discrete (digital). The 
membrane potentials are continuous (analog) quantities.  The neurotransmitter
release from vescicles appears to be quantal. A lot goes on in the brain
besides the transmission of spikes through the axons. It is probably premature
to rule out any of these as substrates for information processing.  

Vasant Honavar
From: elo3552d@desc.dla.mil (Jim M Dagg)
Newsgroups: comp.ai.neural-nets
Subject: req for info on GNN92
Keywords: neural nets
Date: 28 Jul 92 19:15:10 GMT
Organization: Defense Electronics Supply Center Dayton, Oh.

Dear Netters et al:

If anyone knows the venue, itenerary, etc. for the Government Neural Network
Applications Workshop '92 (GNN92) to be held in Dayton OH (USA) in August 92
please mail any/all information to the email addr below. I have tried -- to
no avail -- to email the contact listed in the standard upcoming conference
listings posted. 

Thanks for any/all info in advance, Jim.  email: jdagg@desc.dla.mil

-- 
 -------------------------------------------------------------------------
|My opinions are just that - MY opinions.   | osu-cis!dsacg1!descg1!jdagg|
|Thanks, Karl Popper, for teaching me that  | Internet:jdagg@desc.dla.mil| 
|the key to all learning is making mistakes.| (513)296-5917 (AV)986-5917 |
From: dbk@aber.ac.uk (D B Kell)
Newsgroups: comp.ai.neural-nets
Subject: Re: Learning what COULD be learned
Date: 21 Jul 92 08:20:35 GMT
Organization: University of Wales, Aberystwyth

In article <arms.711663417@spedden> arms@cs.UAlberta.CA (Bill Armstrong) writes:
>The impediment to learning of one output by others that are difficult
>or impossible is closely related to the "Why not trees?" question I
>am asking.  If you use trees, this harmful interaction can't occur.
>
>--
>***************************************************
>Prof. William W. Armstrong, Computing Science Dept.
>University of Alberta; Edmonton, Alberta, Canada T6G 2H1
>arms@cs.ualberta.ca Tel(403)492 2374 FAX 492 1071

Please elaborate much more explicitly! **HOW** do the trees flag that
some things are not learnable, others are.

Douglas Kell.
Newsgroups: comp.ai.nlang-know-rep
From: danny@ponder.csci.unt.edu (Danny Faught)
Subject: Mainstreaming AI
Organization: University of North Texas, Denton
Date: Wed, 29 Jul 1992 20:30:44 GMT

I have heard from several sources that when AI algorithms are proven
successful and mainstreamed into the rest of the computer lore, they
are no longer considered AI.  For example, from Jim Hendler's post,
"AI In the Year 2025 - Responses":

     Voice recognition systems will be very good, widely implemented,
     and will no longer be considered "AI".

My question is, do you know any examples of AI techniques of the past
that were considered AI when they were being developed, but are now 
considered commonplace and having nothing to do with AI?

-- 
Danny Faught    danny@ponder.csci.unt.edu
Save this sig - I'll be famous someday
From: nancym@ccwf.cc.utexas.edu (Nancy Mayer)
Newsgroups: comp.ai
Subject: Existence of AI_ATTIC
Date: 28 Jul 92 20:28:10 GMT
Reply-To: nancym@ccwf.cc.utexas.edu (Nancy Mayer)
Distribution: usa
Organization: The University of Texas at Austin, Austin TX
Originator: nancym@louie.cc.utexas.edu

This is to announce to the world the existence of the AI_ATTIC. The AI_Attic is an anonymous ftp site maintained at The University of Texas at Austin.  In this 
you will find the classic Artificial Intelligence programs, pointers on where 
to buy commercial AI programs, and the like.  Some of the programs we have are  
Parry, Eliza, Doctor, etc.

	This archive is intended for professors teaching courses in AI and 
the students they teach.  But others interested in expert systems, neural 
nets, ATN's, perceptrons, etc are, of course, welcome to rummage around.

	As would be expected in an attic, some things in this archive work, 
others need a little nudge to get them going, and some of them are "over 
the hill" for good.  In all cases they should bring back a sense of 
nostalgia to the old timer and give a sense of history to new workers in 
the field of Artificial Intelligence.

HOW TO ACCESS THE AI_ATTIC
	The AI_ATTIC is an anonymous FTP site that can be accessed by 
telneting or ftping to either the IP address 128.83.186.13 or the node 
address, bongo.cc.utexas.edu  At the request for your name, just type the 
word, anonymous, and at the request for a password, type your own 
personal E-mail address. 

It is important that you give us your address, because we want to justify 
keeping this archive open and you can help by letting us evaluate how 
active it is.  When you follow the above procedure, you will arrive at the 
upper level of the attic directory structure.  We recommend that you now 
download and read the ##PleaseReadMeFirst##  message to get an idea of what 
essentially this message) to get an idea of what is in store for you.  When 
is in store for you.  When you have finished your visit, just type bye at 
the ftp prompt.

Any questions or comments can be sent to the Atticmaster at the address shown
below:  ENJOY!!!
			Atticmaster:  	Dr. B. V. Koen
					atticmaster@bongo.cc.utexas.edu

		Assistants:		Mark Beaudry
					Mohit Dikshit
					Brain Garner
					Kunio Iwata
					Xinghong Li
					Yu-Hshin Liu
					Richard Mach
					Weihan Wu

                                        Vencatram Krishnamurthy
                                        Rusty Thomas
                                        Shutao Liao
                                        Nancy Mayer
                                        Russell Leighton
Xref: sparky comp.ai:2863 comp.ai.shells:360
Newsgroups: comp.ai,comp.ai.shells
Subject: What shell to use
From: bishopg@lincoln.ac.nz
Date: 21 Jul 92 19:22:33 +1200

Hi,
Recently i have started working with expert systems here in New Zealand.
Currently I'm in the process of tracking down and evaluating expert
systems shells for application development.  Information on the
different shells available is hard to come by down here,  so I'm
posting this to the net for information.

I'm interested in hearing from people out there that have recently
been through the same process,  are using shells,  or know about them.
I would be especially interested in hearing from people who can give
me a comparison between shells.  Could you also inform me of articles
that compare or detail shells please.

My requirements are as follows;

  - can be developed and run on a PC
  - runs under either Windows or DOS
  - allows distibution of runtime applications
 
Any suggestions would be greatly appreciated.  Please provide fax numbers
and phone numbers and addresses for those you suggest if possible.

Thanks in advance
Greg
=======================================================================
Greg Bishop-Hurley                          Phone 64 3 3252 811 x8710
Research Officer                              Fax 64 3 3253 839
Farm Management Dept.                      E-Mail BISHOPG@LINCOLN.AC.NZ
Lincoln University
New Zealand
Newsgroups: comp.ai,comp.ai.shells
From: erik@til.til.com (Erik Horstkotte)
Subject: Re: What shell to use
Organization: Togai InfraLogic, Inc.
Date: Thu, 23 Jul 1992 16:14:49 GMT

In article <1992Jul21.192233.221@lincoln.ac.nz>, bishopg@lincoln.ac.nz
writes:
|> Hi,
|> Recently i have started working with expert systems here in New Zealand.
|> [...]
|> My requirements are as follows;
|> 
|>   - can be developed and run on a PC
|>   - runs under either Windows or DOS
|>   - allows distibution of runtime applications
|>  
|> =======================================================================
|> Greg Bishop-Hurley                          Phone 64 3 3252 811 x8710
|> Research Officer                              Fax 64 3 3253 839
|> Farm Management Dept.                      E-Mail BISHOPG@LINCOLN.AC.NZ
|> Lincoln University
|> New Zealand

Have you considered using CLIPS?  It's a public-domain (I think)
expert system shell developed by NASA, and available through their
COSMIC service, including full source code.  It runs on PCs, Macs,
Suns, and many other computers.  I'm not sure if there is a Windows-
specific variant, however.
-- 
Erik Horstkotte, Manager, Software Development, Togai InfraLogic, Inc.
erik@til.til.com, uunet!til!erik - (714) 975-8522
Standard disclaimer: the preceding are my opinions, not TIL's.
Newsgroups: comp.ai
From: pja@news.cis.ohio-state.edu (Peter J Angeline)
Subject: RE: Artificial Life References
Reply-To: pja@cis.ohio-state.edu
Organization: The Ohio State University Department of Computer and Information Science
Date: Thu, 23 Jul 1992 07:18:47 GMT


References for Artificial Life are fairly few at the moment.  There are
proceedings from the first two ALIFE conferences which are pretty good reading
and give a good overview, especially the introductions written by Chris
Langton. Those proceedings are available from Morgan Kaufmann I believe, the
second one came out in january of this year.  I believe Langton was the sole
editor for the first one and Langton and a bunch of people for the second.

There is also a proceedings from the European ALIFE conference published by MIT
Press.  Verela et al are the editors for that one.  Some articles by Holland,
Pattie Maes and Rod Brooks in that one.  I just got it and haven't had a chance
to read it yet.

Lastly, Stuart Levine, author of _Hackers_ just put out a book called
_Artificial Life_ which I've heard is a fine overview with a story.  I saw both
Levine and the book at the ALIFE 3 conference last month and heard good
comments about the book from Randal Beer, an ALIFE researcher.

Hope this helps.

-pete angeline

-------------------------------------------------------------------------------
Peter J. Angeline            ! Laboratory for AI Research (LAIR)
Graduate Research Assistant  ! THE Ohio State University, Columbus, Ohio 43210
ARPA: pja@cis.ohio-state.edu ! "Nature is more ingenious than we are."
From: G.Joly@cs.ucl.ac.uk (Gordon Joly)
Newsgroups: comp.ai
Subject: Re: AI In the Year 2025 - Responses
Date: 30 Jul 92 18:25:53 GMT


See also what Arthur C. Clarke forsaw about satellite communcations in
Wireless World (October 1945).The words are approximately "Terrestrial
Rockets could be the Answer to Worldwide Wireless".

Age 29: paid 5 pounds sterling.

Gordon,
Newsgroups: comp.ai
From: alexis@oahu.cs.ucla.edu (Alexis Wieland)
Subject: Re: Mainstreaming AI
Organization: UCLA Computer Science Department
Date: Fri, 31 Jul 92 15:58:30 GMT

>	Graph search techniques such as depth-first, and breadth-first
>search were once considered AI.
>	Statistical classification systems were also once considered AI.

Long before that, graph theory and statistics were simply considered
math, albeit somewhat obscure math.  AI "cowboys" are notoriously poor
at citing, or even being interested in, the origninators of ideas they
claim to be there own.  This continues to cause alot of antagonism and
places in question the authenticity and merit of much reported work.

    - alexis.            <alexis@CS.UCLA.EDU>

I do AI and neural nets ... makes me one of the worst of the worst :-)
From: pcellik@axion.bt.co.uk (Peter SPHINX Cellik)
Newsgroups: comp.ai
Subject: Re: VIRTUAL REALITY
Date: 22 Jul 92 15:50:16 GMT
Reply-To: pcellik@axion.bt.co.uk (Peter SPHINX Cellik)
Organization: British Telecom Research Labs


In article <552.300.uupcb@brent.uucp>, jon.oringer@brent.uucp (Jon Oringer) writes:
|> 
|>      I am really interested in Virtual Reality and I was wondering is
|> there are any specific conferences in USENET or other networks that
|> specialize in this field of artificial intelligence.  If anybody has any
|> information on where I can find discussion of this topic or anything
|> relevant to it,  please leave a message..
|> 
|>     Thanks..
|>                                                 

You could try sci.virtual-worlds.  It has some stuff.

       SPHINX


====================================================
=== Kill others only if you wish to be killed.   ===
===                                       SPHINX ===   
====================================================
Newsgroups: comp.ai
From: eiverson@nmsu.edu (Eric Iverson)
Subject: Re: Artificial life references
Organization: Computing Research Lab
Date: Fri, 24 Jul 1992 17:29:48 GMT


MAIN TITLE: Artificial life, the proceedings of an Interdisciplinary
            Workshop on the Synthesis and Simulation of Living Systems,
            held September, 1987 in Los Alamos, New Mexico / Christopher
             G. Langton, editor.
 PUBLISHER: Redwood City, Calif. : Addison-Wesley, c1989.

MAIN TITLE: Artificial life II : the proceedings of an interdisciplinary
             workshop on the synthesis and simulation of living systems
            held 1990 in Los Alamos, New Mexico / edited by Christopher
            G. Langton ... [et al.].
 PUBLISHER: Redwood City, Calif. : Addison-Wesley, 1992.

There's also the new book on Artifical Life by Stephen Levy.

--
------------------------------------------------------------------------
Eric Iverson				Internet: eiverson@nmsu.edu
Computing Research Lab
Box 30001/3CRL				Life is something to do when
New Mexico State University		you can't get to sleep.
Las Cruces, NM 88003-0001			-Fran Lebowitz
VOICE: (505) 646-5711	
FAX:   (505) 646-6218
Newsgroups: comp.ai
From: omar@talnext.cc.vanderbilt.edu (Omar Patino-Siliceo)
Subject: Re: ANNOUNCEMENT: Splotch, a Racter/Eliza
Reply-To: omar@talnext.cc.vanderbilt.edu
Organization: Vanderbilt University
Date: Tue, 21 Jul 1992 23:59:22 GMT

In article <1992Jul21.201350.6126@msuinfo.cl.msu.edu> adc@tardis.msu.edu (Alan  
D. Cabrera) writes:

> Actually, it seems that Mr. Crane should apologize for leaving his
> terminal, while logged in, unattended.
> 
> 
> ---
> Alan Cabrera				internet:  adc@tardis.cl.msu.edu
> Computer Laboratory			phone:     (517) 353-3027
> Michigan State University		fax:       (517) 353-9847
> 514 Computer Center			bitnet:    CABRERA@MSU
> East Lansing, MI 48824

And how do you know? Were you the *ONE* that posted the original ("looser")  
message?
--
   __    _            _
  /  \	| |  Omar Patino-Siliceo * Computer Ctr. Vanderbilt Univ. *  Box 1577,
 |    | |-   Sta. B. Nashville, TN 37235.  ***   ``Research is what I am doing
 _\  /_ | \  when I don't know what I'm doing''          --- Wernner von Braun
Newsgroups: comp.ai
From: hamid@lims01.lerc.nasa.gov (HAMID SAMADANI)
Subject: Reusable S/W for AI
News-Software: VAX/VMS VNEWS 1.41    
Organization: NASA Lewis Research Center
Date: 31 Jul 1992 15:35 EST  

I am working on a project to identify reusable artificial intelligence 
software components to be put into a reuse library.  The idea is to find 
components (e.g., heurstic search algorithms) whose designs' are independent 
of specific domains and as such could be used used again on future 
AI software development efforts.

Any thoughts, ideas, pointers, references on this topics would be 
appreciated.

	Hamid Samadani

Newsgroups: comp.ai
From: tsaoj@cs.tamu.edu (Jungfu Tsao)
Subject: AAAI-93 Annual Conference
Organization: Computer Science Department, Texas A&M University
Distribution: usa
Date: Thu, 30 Jul 1992 16:24:37 GMT

Does anybody have any information about the next AAAI-93 annual conference, 
for example, when and where to be held, paper submission deadline, whom to 
contact, etc.? I appreciate it.
From: mchui@spinner.cs.indiana.edu (Michael Chui)
Newsgroups: comp.ai
Subject: Re: Mainstreaming AI
Date: 30 Jul 92 18:00:49 GMT
Organization: Indiana University, Bloomington

In article <1992Jul30.071228.29785@corax.udac.uu.se> stephen@groucho.csd.uu.se (Stephen Cooper) writes:
>One of the Big Guys(tm) in AI -- could it have been McCarthy? -- once said
>something like "AI is everything that machines currently can't do"

	Similarly, John Perry has described philosophy as being the study
of "everything else" which isn't well understood.  For example, the basic
sciences, and medicine, were considered once part of philosophy.

Michael Chui
mchui@cs.indiana.edu
Newsgroups: comp.ai
From: kumar@ditsydh.syd.dit.CSIRO.AU (V.R.Kumar)
Subject: ML for Controlling Dynamic Physical Systems
Organization: CSIRO Division of Info Tech, Sydney, Australia
Date: Wed, 22 Jul 92 06:38:59 GMT

I understand that there have been some work on Neural Nets to 
control dynamic physical systems. But are there any references
on works of conceptual clustering, genetic algorithms, induction,
and other type of Machine learning techniques that have been used
to control dynamic physical systems ?

If so, I would be glad to have the references.

Thanks in advance.

Cheers,

V R Kumar

E-Mail : kumar@syd.dit.csiro.au

-- 
*--------------------------------------------------------------------*
| V.R.Kumar (Ramkumar Venkatachalam)                                 |
| CSIRO, Division of Information Technology                          |
| P.O.Box:1599, Macquarie Centre, North Ryde, NSW 2113, AUSTRALIA    |