Copy Link
Add to Bookmark
Report

Machine Learning List Vol. 3 No. 16

eZine's profile picture
Published in 
Machine Learning List
 · 11 months ago

 
Machine Learning List: Vol. 3 No. 16
Monday, Sept 16, 1991

Contents:
Any interest in a Machine Discovery Workshop
ML program library
Learning & Adaptive Systems
The Machine Learning List is moderated. Contributions should be relevant to
the scientific study of machine learning. Mail contributions to ml@ics.uci.edu.
Mail requests to be added or deleted to ml-request@ics.uci.edu. Back issues
may be FTP'd from ics.uci.edu in pub/ml-list/V<X>/<N> or N.Z where X and N are
the volume and number of the issue; ID: anonymous PASSWORD: <your mail address>

- ------------------------------
Date: Tue, 10 Sep 91 23:55 CST
From: ZYTKOW@wsuiar.wsu.ukans.EDU
Subject: Machine Discovery Workshop, July 4 1992, Aberdeen

To all interested in Machine Discovery Workshop, July 4 1992, Aberdeen

Dear Colleague:

If you are interested in a machine discovery workshop on July 4th,
1992 (Saturday) please let me know. The workshop would follow the
Machine Learning Conference, July 1-3, and would be organized in the
same location in Aberdeen, Scottland.

If you are interested in any of the following, please let me know:
1. submit a paper to the workshop
2. attend the workshop
3. review papers for the workshop
4. any ideas about the workshop
5. suggestions about the Program Committee (people with experience in
the area, who have published several papers on discovery).
Nominate yourself if you will be able to do several reviews of
relatively short papers within 3 weeks in March/April.

The number of people working in the area of machine discovery (scientific
discovery, knowledge discovery in databases, automation of data analysis,
and other areas) is more than a hundred and growing. A substantial
number of projects is under way, and many papers are being prepared for
publication. There is plenty of interesting results which many of us
would like to share. Some of them will be presented during the normal
sessions of ML-92, but many others will not. Some papers will not be
ready before Jan.9 deadline for ML-92. Some of them may be turned down
not because of their quality but because of the competition, or their
subject. If the deadline for the workshop submissions is the end of March
(decisions on the ML-92 are made before March 9) and if our review
process is finished in one month, we may expect papers comparable in
quality to those accepted for ML-92 (or better). It should still be
possible to publish the proceedings of the workshop.

Several overlapping communities will have a chance to meet: those who
work on scientific discovery with those who focus on knowledge discovery
in data bases, and those dealing with data analysis.

We may have a panel discussion of the links between different approaches
to discovery. We may also have a number of demos of discovery systems.
Another possibility is an "ideas" session, focussed on brief presentation
of half-baked or even raw projects, and aimed at constructive feedback.

Best greetings,

-- Jan

Jan Zytkow, Professor
Computer Science Department
Wichita State University
Wichita, KS 67204

zytkow@wsuiar.wsu.ukans.edu

(316) 689-3178

- ------------------------------
Date: Fri, 13 Sep 91 17:03:32 MEZ
From: Werner Emde <EMDE%DOSUNI1.BITNET@yalevm.ycc.yale.EDU>
Subject: ML program library


In 1988 the Special Interest Group on Machine Learning of the German
Society for Computer Science (GI e.V) decided to establish a library
of PROLOG implementations of Machine Learning algorithms. Up to now
the programs were delivered via sending flopppies or via e-mail
(manually). Because of the growing interest in the library we decided
to make the programs available via the anonymous ftp-server at the
University of Osnabrueck:
dione.rz.Uni-Osnabrueck.DE or 131.173.128.15

The contents of the repository can remotely copied to other network
sites via ftp to 'dione.rz.Uni-Osnabrueck.DE '. The userid is
'anonymous' or 'ftp', as password enter your own userid. Execute
'cd pub/unix/mlp' to find the (archived and compressed) directories
with the programs, some small test data sets and demonstation LOG files.
In order to generate the directories shown below you need to enter
'uncompress <prog-name>.tar.Z' and then 'tar -xvf <prog-name>.tar'.

The library will still be maintained and extended by Thomas Hoppe.
Thomas Hoppe has made slight changes to the programs supplied by the
different authors in order to make them independent of a specific
PROLOG dialect (as far as possible). The demo-log files have been
produced using QUINTUS PROLOG (Release 2.4).

The names and addresses of the authors, references to the origin
of the algorithms, and hints how the programs can be started are
usually included in the program files.

The file LOGFILE lists changes and modifications to the library.
This file should make it easy for you to determine what's new
since you last looked at it.


arch1/
arch1.pro Winston's incremental learning procedure for
structural descriptions (author: Stefan Wrobel)
arch1_1.pro Winston's example archs
arch1.log Log-file of a sample run
arch2/
arch2.pro a minimal implementation of Winstons's ARCH
(author: Ivan Bratko)
arch2_1.pro a small test set
arch2.log Log-file of a sample run
aq1/
aq1.pro reimplementation of Becker's AQ-PROLOG (based
on Michalski's AQ)
(author: Thomas Hoppe)
aq1_1.pro a simple data set
aq1_2.pro Extensions to aq1_1.pro
cobweb/
cobweb.pro a PROLOG implementation of Fisher's COBWEB
(author: Joerg-Uwe Kietz)
cobweb_1.pro a simple data set describing some hotels
cobweb.log Log-file of a sample run
discr/
discr.pro Brazdil's generation of discriminations from
derivation trees (author: Thomas Hoppe)
discr_1.pro Simple abstract example
discr_2.pro Abstract example generating useful and not
useful descriminants (author: Thomas Hoppe)
id3/
idt1.pro ID3.1 Implementation of Quinlan's ID3 algorithm
based on the 'gain-ratio'-measure
(authors: Luis Torgo, Thomas Hoppe)
idt1_1.pro simple example data set
idt1_2.pro simple example data set
idt1_3.pro simple example data set
invers/
invers.pro Implementation of absorption and intra-construction
operators for inverse resolution
(author: Thomas Hoppe)
invers_1.pro example calls
logic/
logic.pro Substitution matching, term generalizations,
generalized subsumption
logic_1.pro Example calls
vs/
vs.pro Implementation of Mitchell's version space algorithm
vs_1.pro a simple shape and color taxonomy
vs_1.log Log-file of a sample run




Suggestions and complaints about the ftp-library are welcome any time by:

Werner Emde
University of Osnabrueck
FB 7, Projekt LILOG-OS
Postfach 44 69, Sedanstr. 4
W 4500 - Osnabrueck
Germany

email: emde@dosuni1.rz.Uni-Osnabrueck.de
FAX: + 49 + 541 + 969 2500
Phone: + 49 + 541 + 969 2584



Additional PROLOG implementations of Machine Learning Algorithms
are welcome by:

Thomas Hoppe
Mommsenstr. 50
1000 Berlin 12
Germany

email: hoppet@tubvm.cs.tu-berlin.de

- ------------------------------
From: cmiller@SRC.Honeywell.COM (Chris Miller)
Subject: cfp: Learning & Adaptive Systems
Date: Fri, 13 Sep 91 20:50:24 GMT




CALL FOR PAPERS
ADAPTIVE AND LEARNING SYSTEMS
SPIE
Orlando, FL. 20-24 April, 1992


Part of the International Society for Optical Engineering (SPIE)
International Symposium and Exhibition on Optical Engineering and
Photonics.


CONFERENCE TOPICS:

Adaptation and learning is rapidly becoming a major technology area with
diverse military and commercial applications such as industrial robotics,
machine vision, space exploration, avionic controls, medical diagnosis, and
geological exploration.

This conference will address the advances in adaptation and learning,
will investigate different technical approaches and explore how techniques
being pursued in one area can benefit the others.


RECOMMENDED PAPER TOPICS:

A focus on optical or sensing techniques, machine vision and perception,
object recognition, etc. is not required for paper submission. Emphasis on
applied systems and techniques is encouraged, but not required. Papers
addressing integration of techniques, particularly with regards to the
joint application domains of learning and sensing, are especially
encouraged.

Papers are solicited on the following and related topics:

* genetic algorithms
* explanation-based learning
* automatic algorithm design
* automated knowledge acquisition
* artificial neural networks
* inductive learning methods
* case-based techniques
* adaptive controls
* systems applications
* adaptive signal processing
* wavelet theory


CONFERENCE CHAIR: Firooz A. Sadjadi
Honeywell Systems and Research Center
3660 Technology Dr.
Minneapolis, MN 55418 USA
sadjadi@src.honeywell.com

CO-CHAIRS: Simon Haykin
Communication Research Lab.
McMaster University
1280 Main Street West
Hamilton, Ontario L854KI
Canada

Christopher A. Miller
Honeywell Systems and Research Center
3660 Technology Dr.
Minneapolis, MN 55418 USA
cmiller@src.honeywell.com



SUBMISSION OF ABSTRACTS:

Four copies of an abstract and related material (as described below) should
be submitted by October 1, 1991 to:

Orlando '92
SPIE
P.O. Box 10
Bellingham, WA 98227-0010

Telephone: (206) 676-3290
Telex: 46-7053
Telefax: (206) 647-1445
OPTO-LINK (206) 733-2998

Submissions should be limited to one page and must include the following
information:

1. Title of Abstract/Paper

2. Authors' full names and affiliations-- list authors in the order
desired for publication (i.e., principal author first).

3. Placement-- Include a sentence indicating that the paper is intended
for the Adaptive and Learning Systems conference (chair: Sadjadi) and
whether oral or poster presentation format is preferred.

4. Abstract text-- Abstracts should be brief (200 words) and typed on
white paper. Abstracts should contain enough detail to convey the
approach and the results of the research. Government and company
clearance to present and publish should be final at the time of
submittal.

5. Brief Biography-- 50 to 100 words describing the author(s)
affiliations, interests, etc.

On a separate sheet of paper, please enclose the authors' complete
addresses and telephone/telex/telefax numbers.


DATES:

Abstract due date: 1 October, 1991 (late submissions may be considered,
subject to program time availability and chair's
approval.)

Notification of acceptance: 20 December, 1991

Manuscript due date: 23 March, 1992

Conference dates: 20-24 April, 1992.


ADDITIONAL INFORMATION:

Placement-- Submissions may be placed in an oral or a poster session at the
chair's discretion.

Proceedings-- These meetings will result in published Proceedings that can
be ordered through the Advance Program. Manuscripts are
required of all accepted applicants and must be submitted in
English by 23 March 1992 on SPIE-provided paper. Copyright to
the manuscript is expected to be released for publication in
the conference Proceedings.

Paper Review-- Commercial papers, descriptions of papers with no research
content, and papers where supporting data or a technical
description cannot be given for proprietary reasons will not be
accepted for presentation in this symposium. To assure a high
quality conference, all abstracts and Proceedings papers will
be reviewed by the Conference Chairs for technical merit and
content.

Oral Presentations-- Each author is generally allowed 20 minutes plus a
five-minute discussion period. SPIE will provide the following
media equipment free of charge: 35mm carousel slide projectors,
overhead projectors, and electric pointers. Additional
equipment may be arranged by SPIE at the speaker's expense.

Author Benefits-- An author or co-author who attends the conference will
be accorded a reduced-rate registration fee, a copy of the
Proceedings in which his/her paper appears, a complimentary
one-year, non-voting membership in SPIE (if never before a
member), and other special benefits.

- ------------------------------

END of ML-LIST 3.16


← previous
next →
loading
sending ...
New to Neperos ? Sign Up for free
download Neperos App from Google Play
install Neperos as PWA

Let's discover also

Recent Articles

Recent Comments

Neperos cookies
This website uses cookies to store your preferences and improve the service. Cookies authorization will allow me and / or my partners to process personal data such as browsing behaviour.

By pressing OK you agree to the Terms of Service and acknowledge the Privacy Policy

By pressing REJECT you will be able to continue to use Neperos (like read articles or write comments) but some important cookies will not be set. This may affect certain features and functions of the platform.
OK
REJECT