HTML>
Knowledge Discovery Nuggets(tm) 98:15, e-mailed 98-06-30
Knowledge Discovery Nuggets Index
To KDNuggets Directory
| Here is how to subscribe to KD Nuggets |
This Year |
Past Issues
Knowledge Discovery Nuggets(tm) 98:15, e-mailed 98-06-30
News:
(text)
Foster Provost, KDD-98 Best Paper Awards:
www.kdnuggets.com/meetings/kdd98/best-paper-awards.html
(text)
Ismail Parsa, Call for Participation: KDD-CUP-98
www.kdnuggets.com/meetings/kdd98/kdd-cup-98.html
(text)
GPS, ZDNet: Tech companies form new privacy alliance
http://www.zdnet.com/zdnn/stories/zdnn_display/0,3440,2114258,00.html
Requests:
(text)
Xindong Wu, Identifying Patterns in Call Graphs ?
Publications:
(text)
John Major, J. of ASA: On Measuring and Correcting the Effects of
Data Mining and Model Selection
(text)
Yan Zhang, New Book: Compensatory Genetic Fuzzy Neural Networks
http://www.wspc.com.sg/books/bookshop.html
Tools/Services:
(text)
J.P. Brown, SuperInduction Update
http://www.hal-pc.org/~jpbrown
(text)
Marco Ramoni, Bayesian Knowledge Discoverer for MS Windows 95/NT
http://kmi.open.ac.uk/projects/bkd/
Positions:
(text)
Graham Williams, Australia: Senior Data Mining Position Available
http://www.dit.csiro.au/~gjw/dataminer
Courses:
(text)
Eric King, Course: DATA MINING: PRINCIPLES AND PRACTICE,
Aug 5-7 (Portland, ME), Sep 16-18 (Santa Clara, CA), and
Nov 4-6 (Dallas, TX), http://www.gordianknot.com
(text)
Saso Dzeroski, ILP Tutorial Day,
21 July 1998, Madison, Wisconsin, USA
http://www-ai.ijs.si/SasoDzeroski/ilptut98.html
Meetings:
(text)
Tae Horn, KDD-98 Workshop 'Datamining in Finance': Call for participation
http://www-vwl3.wiwi.uni-karlsruhe.de/vwl3/cpf.html
(text)
Anthony HUNTER, CFP: ECSQARU99: European Conf. on Symbolic and
Quantitative Approaches to Reasoning with Uncertainty,
5-9 July 1999 at UCL, London, UK
http://www.cs.ucl.ac.uk/staff/a.hunter/ecsqaru
(text)
David Heckerman, Uncertainty 99: Workshop on AI and Statistics,
Reminder: Abstracts due July 1, 1998
http://uncertainty99.microsoft.com/
(text)
Ulrich Reimer, 2nd Int. Conf. on Knowledge Management: PAKM98
http://research.swisslife.ch/pakm98.html
--
Knowledge Discovery Nuggets (tm) is an electronic newsletter focusing
on the latest news, publications, tools, meetings, and other relevant items
in the Data Mining and Knowledge Discovery field.
KD Nuggets is currently reaching over 5100 readers in 70+ countries
2-3 times a month.
Items relevant to data mining and knowledge discovery are welcome
and should be emailed to gps
in ASCII text or HTML format.
An item should have a subject line which clearly describes
what is it about to KDNuggets readers.
Please keep calls for papers and meeting announcements
short (50 lines or less of up to 80-characters), and provide a web site for
details, such as papers submission guidelines.
All items may be edited for size.
To subscribe, see http://www.kdnuggets.com/subscribe.html
Back issues of KD Nuggets, a catalog of data mining tools
('Siftware'), pointers to data mining companies, relevant websites,
meetings, etc are available at KDNuggets Directory at
http://www.kdnuggets.com/
-- Gregory Piatetsky-Shapiro (editor)
gps
********************* Official disclaimer ***************************
All opinions expressed herein are those of the contributors and not
necessarily of their respective employers (or of KD Nuggets)
*********************************************************************
~~~~~~~~~~~~ Quotable Quote ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
A young man asks the rabbi about who is truly a wise man. The rabbi
says: 'Any dummy can be right 50% of the time. A wise man is right 60%
of the time. Rabbi Rosenberg from Bialystok was right 75% of the
time. However, if someone is right 90% of the time, it is very
suspicious, and if someone is right 100% of the time, he must be a
bad, violent criminal man, and you should avoid him like a plague'.
Thanks to Tom Fawcett, rec.humor.funny, and przemek@tux.org
Previous
1 Next Top
Date: Tue, 30 Jun 1998 08:14:13 -0400
From: Foster Provost, foster@Basit.COM
Subject: KDD-98 Best Paper Awards
Web: www.kdnuggets.com/meetings/kdd98/best-paper-awards.html
The KDD-98 Awards Committee is proud to announce that the votes for
'Best Paper' have been tallied and there are clear winners in both
categories. It should be noted that these papers are the best of the
best. Acceptance alone to KDD-98 is a considerable achievement: only
68 papers were accepted out of 247 submitted.
Special thanks are in order for the Awards Committee members, who each
volunteered to read more than a dozen papers (beyond their normal
reviewing duties) to help select the winners.
The awards will be presented during the opening of the conference
(Thursday August 27 at 1:30pm).
So, without further ado .... (drumroll please)
The 'Knowledge Stream Partners' KDD-98 Best Paper Awards go to:
--------- ------ -------- --- -- ---- ----- ------
[Fundamental Research Category]
Pedro Domingos for 'Occam's two razors: the sharp and the blunt'
[Applications Category]
Luc Dehaspe, Hannu Toivonen and Ross D. King for 'Finding frequent
substructures in chemical compounds'
------
Accompanying each award will be a check for $1000, courtesy of
Knowledge Stream Partners (thanks to Gregory and Robert van der Hooning).
------
Honorable mentions are in order for three other papers:
[Fundamental Research Category]
Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Renganathan, and
Padhraic Smyth for 'Rule discovery from time series'
Alexander Hinneburg and Daniel Keim for 'An efficient approach to
clustering in large multimedia databases with noise'
[Applied Research Category]
Wenke Lee, Salvatore Stolfo and Kui Mok for 'Mining audit data to
build intrusion detection models'
Congratulations to all the authors!
KDD-98 Awards Committee
Foster Provost (Chair)
Chid Apte
Robert Bayardo
Wray Buntine
Soumen Chakrabarti
Tom Fawcett
Ronen Feldman
Georges Grinstein
David Hand
David Jensen
T.Y.Lin
Brij Masand
Gregory Piatetsky-Shapiro
Pat Riddle
Ramasamy Uthurusamy
Graham Williams
Previous
2 Next Top
Date: Tue, 30 Jun 1998 19:39:58 -0400
From: Ismail Parsa, iparsa@epsilon.com
Subject: CFP: KDD-CUP-98
Web: www.kdnuggets.com/meetings/kdd98/kdd-cup-98.html
+--------------------------------------------------------------------+
| CALL FOR PARTICIPATION |
| |
| KDD-CUP-98 |
| |
| The Second International Knowledge Discovery and |
| Data Mining Tools Competition |
| |
| Held in Conjunction with KDD-98 |
| |
| The Fourth International Conference on Knowledge |
| Discovery and Data Mining |
|www.kdnuggets.com
or |
|www-aig.jpl.nasa.gov/kdd98
or |
|www.aaai.org/Conferences/KDD/1998
|
| |
| Sponsored by the |
| |
| American Association for Artificial Intelligence (AAAI) |
| Epsilon Data Mining Laboratory |
| Paralyzed Veterans of America (PVA) |
+--------------------------------------------------------------------+
KDD-CUP is a knowledge discovery and data mining (KDDM) tools
competition held in conjunction with the International Conference on
Knowledge Discovery and Data Mining.
Last year, the CUP enjoyed worldwide participation of 45 data mining
tools. The Gold Miner award was jointly shared by UCSD's BNB (Boosted
Naive Bayes Classifier) software and Urban Science's GainSmarts
software. SGI's MineSet was the runner-up and has earned the Bronze
Miner award. For more information on KDD-CUP-97, please refer to the
URL:www.epsilon.com/new.
Some of the highlights from last year's
competition are as follows:
o The success of the Naive Bayes algorithm (used by 2 of the top 3
contestants)
o No clear evidence backing the hypothesis that there are 'real'
returns to incremental data preprocessing activity.
KDD-CUP-98 will follow on the success of last year's competition. The
CUP is again open to all KDDM tool vendors, academics with research
prototypes and corporations with significant applications. Attendance
to the KDD-97 conference is not required to participate in the CUP.
+--------------------------------------------------------------------+
| KDD-CUP Process and Important Dates |
+--------------------------------------------------------------------+
o Registration and signing of the NDA (Non-Disclosure Agreement)
July 1-15, 1998
o Release of the datasets (learning and validation), related
documentation and the KDD-CUP questionnaire
July 16, 1998
o Return of the results and the KDD-CUP questionnaire
August 14, 1998
o KDD-CUP Committee evaluation of the results
August 15-25
o Individual performance evaluations send to the participants
August 25, 1998
o Public announcement of the winners and awards presentation during
KDD-98 in New York City
August 29, 1998
+--------------------------------------------------------------------+
| KDD-CUP Data Set |
+--------------------------------------------------------------------+
The data set for this year's Cup has been generously provided by the
Paralyzed Veterans of America (PVA). PVA is a not-for-profit
organization that provides programs and services for US veterans with
spinal cord injuries or disease. With an in-house database of over 13
million donors, PVA is also one of the largest direct mail fund
raisers in the country.
Participants in the CUP will demonstrate the performance of their tool
by analyzing the results of one of PVA's recent fund raising appeals.
This mailing was dropped in June 1997 to a total of 3.5 million PVA
donors. It included a gift 'premium' of personalized name & address
labels plus an assortment of 10 note cards and envelopes. All of the
donors who received this mailing were acquired by PVA through
premium-oriented appeals like this.
The analysis data set will include:
o A subset of the 3.5 million donors sent this appeal
o A flag to indicate respondents to the appeal and the dollar amount
of their donation
o PVA promotion and giving history
o Overlay demographics, including a mix of household and area level
data.
Unlike least year, all available information about the fields will be
made available in the project documentation.
The objective of the analysis will be to identify response to this
mailing -- a classification or discrimination problem.
+--------------------------------------------------------------------+
| Performance Evaluation Criteria |
+--------------------------------------------------------------------+
The CUP is aimed at recognizing the most accurate, innovative,
efficient and methodologically advanced data mining tools in the
marketplace.
The participants will again be evaluated based on the performance of
their algorithm on the validation or hold-out data set. The KDD-CUP
program committee will consider the following metrics in their
evaluations:
o Lift curve or gains table analysis listing the cumulative percent of
targets recovered in the top quantiles of the file
o Receiver operating characteristics (ROC) curve analysis and the area
under the ROC curve
o Several statistical tests to ensure the robustness of the results.
Last year, the performance in the top 10 percent of the file was
considered as a measure of precision while the performance in the top
40 percent of the file was considered as a measure of stability and
marketing coverage. The average performance up to the 40th percentile
was also looked at as a measure of overall performance.
+--------------------------------------------------------------------+
| KDD-CUP-97 Program Committee |
+--------------------------------------------------------------------+
o Vasant Dhar, New York University, New York, NY
o Tom Fawcett, Bell Atlantic, New York, NY
o Georges Grinstein, University of Massachusetts, Lowell, MA
o Ismail Parsa, Epsilon, Burlington, MA
o Gregory Piatetsky-Shapiro, Knowledge Stream Partners, Boston, MA
o Foster Provost, Bell Atlantic, New York, NY
o Kyusoek Shim, Bell Laboratories, Murray Hill, NJ
+--------------------------------------------------------------------+
| REGISTRATION |
+--------------------------------------------------------------------+
All participants are required to complete the application form below
and send it in plain ASCII format to (e-mail preferred):
+-----------------------------+
| Ismail Parsa |
| |
| Epsilon |
| 50 Cambridge Street |
| Burlington MA 01803 USA |
| |
| E-MAIL: iparsa@epsilon.com
|
| V-MAIL: (781) 273-0250*6734 |
| FAX: (781) 272-8604 |
+-----------------------------+
The participants will receive the NDA (non-disclosure agreement)
before the July 15, 1998 deadline. Please contact Ismail Parsa if you
did not receive the NDA before July 15.
Last year, the KDD-CUP program committee publicly announced the names
of only the top 3 performing tools. The names of the 45 participants
were not released. This year, although we will again only announce
the names of the top 3 performing tools, we will make the list of
participants publicly available UNLESS THE PARTICIPANTS INDICATE THAT
THEY WILL PRESERVE THEIR ANONYMITY BY CHECKING THE APPROPRIATE BOX IN
THE REGISTRATION BROCHURE. We think it's fair for everyone to know
who they are competing with.
Please see www.kdnuggets.com/meetings/kdd98/kdd-cup-98-reg.txt
for the registration brochure
Previous
3 Next Top
Date: Wed, 24 Jun 1998 03:15:16 -0400 (EDT)
From: GPS gps
Subject: ZDNet: Tech companies form new privacy alliance
Web: http://www.zdnet.com/zdnn/stories/zdnn_display/0,3440,2114258,00.html
ZDNet Maria Seminerio
reports that a privacy alliance meant to protect consumers' personal
data has been formed among technology companies and other firms doing
business on the Internet.
The 50-odd companies calling themselves the Online Privacy Alliance
pledged to clearly state what kinds of data they collect on their Web
sites and how they intend to use it.
For full details see
http://www.zdnet.com/zdnn/stories/zdnn_display/0,3440,2114258,00.html
Previous
4 Next Top
Date: Fri, 19 Jun 1998 20:44:52 +1000 (EST)
From: Xindong Wu, xindong@insect.sd.monash.edu.au
Subject: Identifying Patterns in Call Graphs [Q]
A ``call graph'' is a directed graph with vertices representing basic
data values and edges representing how these basic data values are
passed to sub-routines. With some reverse engineering tools, call
graphs can be automatically generated from both procedural programs
and O-O systems. One of the problems that we are currently working on
is to identify 'similar' subgraphs, called patterns, in the call
graphs. I would appreciate pointers for references relevant to this
work.
Xindong Wu
Previous
5 Next Top
Date: Wed, 24 Jun 1998 08:19:17 -0700
From: John A.Major jmajor@internetMCI.com
Subject: Generalized Degrees of Freedom
KDNuggets readers should be made aware of the following article:
Ye, Jianming, 'On Measuring and Correcting the Effects of Data Mining
and Model Selection,' Journal of the American Statistical Association,
March 1998, Volume 93, Number 441, pp 120-131.
Professor Ye develops the notion of generalized degrees of freedom (GDF)
which is an extension of the idea of degrees of freedom being the number
of parameters in a regression. The GDF concept, however, is applicable
to arbitrarily complex model selection processes including CART,
projection pursuit, and artificial neural networks. GDF is shown to make
for good estimates of error variance with the usual RSS/(n-p) formula
and to 'de-bias' the Akaike Information Criterion for model selection.
GDF is rather straightforward (if compute intensive) to calculate. A
CART example shows that GDF can be substantially larger than the number
of terminal nodes.
John A. Major, ASA 7 Old County Highway
Senior Vice President East Granby, CT, USA 06026
Quantitative Services (860) 658-4129
Guy Carpenter & Company, Inc. jmajor@guycarp.e-mail.com
Previous
6 Next Top
Date: Thu, 25 Jun 1998 09:56:08 -0400 (EDT)
From: 'Yan Q. Zhang' yqz@canes.gsw.edu
Subject: New Book: Compensatory Genetic Fuzzy Neural Networks
Web: http://www.wspc.com.sg/books/bookshop.html
Please check http://www.wspc.com.sg/books/bookshop.html
, then select 'Forthcoming Titles' on the left pad, you may
find the coming book 'Compensatory Genetic Fuzzy Neural Networks
and Their Applications', you may click the title, then on-line
order the book.
Thanks for your attention!
Y.Q. Zhang
Previous
7 Next Top
Date: Tue, 23 Jun 1998 16:41:10 -0500
From: 'J.P.Brown' jpbrown@hal-pc.org
Subject: SuperInduction Update
Web: http://www.hal-pc.org/~jpbrown
There have been some great new KDD developments recently, but I can see
that there are still many ways that faster, more reliable and completely
objective data mining and knowledge discovery can be achieved. Some
readers will remember the early progress of SuperInduction, last year.
This up-dated version http://www.hal-pc.org/~jpbrown
(much more to
come) shows that the path to perfection is being hotly pursued.
Previous
8 Next Top
Date: Sun, 21 Jun 1998 13:50:53 +0100
From: Marco Ramoni m.ramoni@open.ac.uk
Subject: Bayesian Knowledge Discoverer for MS Windows 95/NT
Web: http://kmi.open.ac.uk/projects/bkd/
BAYESIAN KNOWLEDGE DISCOVERER
Version 1.0 (Beta) for MS Windows 95/NT
Bayesian Knowledge Discoverer (BKD) is a computer program designed to
extract Bayesian Belief Networks from (possibly incomplete) databases.
The aim of BKD is to provide a Knowledge Discovery tool able to
extract reusable knowledge from databases, using sound and accountable
statistical methods. BKD Version 0.1 and Version 0.2 have been
distributed in over 1000 copies worldwide.
CAPABILITIES
The capabilities of BKD Version 1.0 (Beta) include: estimation of
conditional probability from data, extraction of the graphical
structure from data, goal oriented evidence propagation, missing data
handling using Bound and Collapse discretization of continous variables,
automated definition of nodes from data from data, conversion from and
to the proposed standard Bayesian Networks Interchance Format (BNIF),
Graphic User Interface and a movie-based on-line help.
REQUIREMENTS
BKD Version 1.0 (Beta) for MS Windows 95/NT requires MS Windows 95/NT,
32 MB RAM (64 MB preferred), and 30 MB of free diskspace.
DISTRIBUTION
A copy of BKD Version 1.0 (Beta) for MS Windows 95/NT can be
downloaded from the WWW site of the Bayesian Knowledge Discovery
Project, The Open University at http://kmi.open.ac.uk/projects/bkd/
Previous
9 Next Top
Date: Fri, 19 Jun 1998 14:25:24 +1000
From: Graham Williams Graham.Williams@cmis.csiro.au
Subject: Senior Data Mining Position Available (Canberra, Australia)
Web: http://www.dit.csiro.au/~gjw/dataminer
CSIRO Mathematical & Information Sciences
Project Leader/Senior Research Scientist
Analysis of Large and Complex Datasets/Data Mining
Canberra
$67K - $88K + superannuation
Data Mining: http://www.dit.csiro.au/~gjw/dataminer
CMIS Web: http://www.cmis.csiro.au
CSIRO is the Australian Govenrment's scientific research organisation.
We are seeking to appoint a senior research scientist to lead a team
of scientists working on applications with large and complex datasets.
The team consists of around 10 Statisticians and Computer Scientists
with interests in techniques for handling and cleaning large datasets,
modelling large datasets, data mining, wavelet methods for feature
extraction, statistical visualisation and modelling multiple time
series. The team is working on datasets coming from areas as diverse
as motor vehicle insurance, finance, marketing and astronomy.
You should have a PhD or equivalent qualification with research
experience in some area of computational statistics/data mining and
with a strong commitment to perform and apply your research to the
benefit of industry. The successful candidate must have the skills
and desire to manage the Project and interact with industry at all
stages of their work - from problem identification, to research and
development, and through to application.
This is an indefinite position and is located in Canberra however
consideration would be given to the position being located in
Sydney. Further information about the position may be obtained from Dr
Graham Mills, tel (08) 8303 8784 email: graham.mills@cmis.csiro.au
until 26 June, 1998 or Dr Mark Berman, tel, (02) 9325 3209 email:
mark.berman@cmis.csiro.au.
Details are also available from http://www.cmis.csiro.au
Applications for the position should address the selection criteria,
be marked ``Confidential'' quoting reference number 98/C8, and be sent
to: Mrs Lisa Weller, CSIRO, Mathematical and Information Sciences,
Private Bag 2, Glen Osmond SA 5064 by 24 July, 1998.
CSIRO is committed to Equal Employment Opportunity principles and practices.
Previous
10 Next Top
Date: Tue, 23 Jun 1998 12:47:42 -0400
From: Eric King, eric@heuristics.com
Subject: Course: DATA MINING: PRINCIPLES AND PRACTICE
Web: http://www.gordianknot.com
DATA MINING: PRINCIPLES AND PRACTICE
A broad-brushed, intensive introduction of
methods, applications, tools and techniques
offered by
The Gordian Institute
August 5-7, Portland, Maine
September 16-18, Santa Clara, California
November 4-6, Dallas, Texas
Registration: $1495
WHAT MAKES THIS COURSE UNIQUE?
This course focuses on actual use and implementation of data mining
methods. The instructor will also show how to evaluate various
data mining products. Exercises will reveal impressive results
from the same tool that may have failed in other categories. The
workshops will save immeasurable time and effort in assessing and
selecting which suite of tools and techniques will perform best for
your application.
WHAT YOU WILL LEARN
- The basic principles of data mining
- The different methods of data mining and how they compare
- How to prepare raw data for data mining
- How to analyze and validate the results
- What questions data mining can answer
- What are the pitfalls and how to avoid them
- What commercial products are available and how to evaluate them
REQUEST FULL COURSE DETAILS
You will quickly receive complete details to include pricing, course
outline, instructor background, site logistics and registration form
through any of the following:
- Email: agent@gordianknot.com
Send an Email message with your request in the subject field:
- DATA MINING COURSE DETAILS
- GORDIAN'S QUARTERLY ELECTRONIC NEWSLETTER
- Toll Free: 800-405-2114
- Direct: 281-364-9882
- Fax: 281-754-4014
- http://www.gordianknot.com
Previous
11 Next Top
Date: Sun, 21 Jun 1998 15:46:57 +0200 (METDST)
From: Saso Dzeroski PhD Saso.Dzeroski@ijs.si
Subject: ILP Tutorial Day
Web: http://www-ai.ijs.si/SasoDzeroski/ilptut98.html
Call for Participation
Inductive Logic Programming
Tutorial Day
21 July 1998, Madison, Wisconsin, USA
------------------------------------------------------------------------
Immediately before the The Eighth International Conference on Inductive
Logic Programming and The Fifteenth International Conference on Machine
Learning
------------------------------------------------------------------------
More information at http://www-ai.ijs.si/SasoDzeroski/ilptut98.html
------------------------------------------------------------------------
Inductive logic programming (ILP) is a research area at the intersection of
inductive machine learning and logic programming. The general aim of ILP is
to develop theories, techniques and applications of inductive learning from
observations and background knowledge represented relationally in a first
order logical framework. Recent developments have brought ILP closer to
practical applications: ILP has been successfully used in a variety of
domains including ecology, mechanical engineering, molecular biology,
natural language processing and traffic control. It is thus an important
technology that can be used in a variety of areas ranging from relational
knowledge discovery in databases to relational reinforcement learning.
The tutorial day follows up on the successful Summer School on Inductive
Logic Programming and Knowledge Discovery in Databases, held in Prague,
Czech Republic in September 1997. It will provide its attendants with an
introduction to the field of ILP and an overview of state-of-the-art ILP
techniques and applications.
Previous
12 Next Top
Date: Tue, 30 Jun 1998 15:13:14 +0200 (MET DST)
From: Tae Horn Hann thh@vwl3sun1.wiwi.uni-karlsruhe.de
Subject: Workshop 'Datamining in Finance': Call for participation
Web: http://www-vwl3.wiwi.uni-karlsruhe.de/vwl3/cpf.html
CALL FOR PARTICIPATION
Workshop: Data Mining in Finance
to be held in conjunction with
The Fourth International Conference on Knowledge Discovery and Data
Mining (KDD 98)
31. August 1998
Marriott Marquis, New York City
Motivation
DATA MINING is being increasingly applied in Finance, especially to
support financial asset management and risk management. It is considered
by many financial management institutions as an innovative technology to
support conventional quantitative techniques. Its use in computational
finance will have a major impact in the modeling of currency markets, in
tactical asset allocation, bond and stock valuation and portfolio
optimization. In addition the application of Data Mining for scoring tasks
delivers valuable support for the management of client credit risk and
fraud detection.
Home-Page of the Workshop:
http://www-vwl3.wiwi.uni-karlsruhe.de/vwl3/cpf.html
This workshop addresses practitioners as well as researchers who are
active in this topic such as finance, econometrics, statistics and
information systems. The workshop aims to bring together people who
are familiar with quantitative and empirical aspects of financial markets
or/and interested in quantitative methods which can be applied to data
mining in finance.
Inited speakers: Andreas Weigend, NYU
Hans Georg Zimmermann, Siemens AG
Participants are expected to take actively part in the discussion will be
chosen based on their research interest.
Researchers / Practitioners who are interested to attend should email to
Tae Horn Hann,
Institute for Statistics and Mathematical Economics
University of Karlsruhe
Rechenzentrum, Zirkel 2
76128 Karlsruhe, Germany
e-mail: THH@VWL3SUN1.WIWI.UNI-KARLSRUHE.DE
Phone: 49 721 608 3383
Fax: 49 721 608 3491
Previous
13 Next Top
Date: Tue, 23 Jun 1998 16:21:52 +0100
From: Anthony HUNTER A.Hunter@cs.ucl.ac.uk
Subject: CFP: ECSQARU99: European Conf. on Symbolic and Quantitative
Approaches to Reasoning with Uncertainty,
Web: http://www.cs.ucl.ac.uk/staff/a.hunter/ecsqaru
FIRST CALL FOR PAPERS FOR ECSQARU'99
...........................................................
European Conference on Symbolic and Quantitative Approaches
to Reasoning with Uncertainty
...........................................................
5-9 July 1999 at UCL, London, UK
Webpage atwww.cs.ucl.ac.uk/staff/a.hunter/ecsqaru
AIMS AND SCOPE: Uncertainty is in an increasingly important research
topic in many areas of computer science. The main European forum for
the subject is the European Conference on Symbolic and Quantitative
Approaches to Reasoning and Uncertainty (ECSQARU). These have been
held in Marsellies (1991), Granada (1993), Fribourg (1995), and Bonn
(1997). The next in the series is ECSQARU'99 in London in July 1999.
AREAS FOR CONTRIBUTION (not exclusive): Default reasoning; Belief
revision; Logics for reasoning with uncertainty; Paraconsistent
logics; Belief functions; Bayesian networks; Probabilistic reasoning;
Fuzzy systems; Aggregation of arguments; Inconsistency handling;
Decision systems; Fusion systems; Argumentation systems; Applications
of uncertainty formalisms; Automated reasoning systems for uncertainty
formalisms; Machine learning for uncertainty formalisms.
PROGRAM COMMITTEE:
Tony Hunter (London) - Program chair
Henri Prade (Toulouse) - Data fusion
Finn Jensen (Aalborg) - Bayesian networks
Torsten Schaub (Potsdam) - Default systems
Philippe Smets (Bruxelles) - Belief functions
Dov Gabbay (London) - Logics
Rudolf Kruse (Magdeburg) - Fuzzy methods
SUBMISSION OF PAPERS: Please see
www.cs.ucl.ac.uk/staff/a.hunter/ecsqaru
IMPORTANT DATES: Submission deadline 31 January 1999; Notification
of acceptance 12 March 1999; CRC for accepted papers 16 April 1999;
Workshops and tutorials 5-6 July 1999; Main conference 7-9 July 1999
Previous
14 Next Top
Date: Wed, 24 Jun 1998 12:54:46 -0700
From: David Heckerman heckerma@MICROSOFT.com
Subject: Uncertainty 99, Workshop on Artificial Intelligence and Statistic
s. Reminder: Abstracts due July 1.
Web: http://uncertainty99.microsoft.com/
UNCERTAINTY 99
Seventh International Workshop on Artificial Intelligence and Statistics
January 3-6, 1999
Ft. Lauderdale, Florida
http://uncertainty99.microsoft.com/
This is a reminder that abstracts are due July 1st.
Submission Requirements:
An extended abstract (up to 4 pages) should be emailed
(either ascii, word, postscript or a WWW address) to
joe.whittaker@lancaster.ac.uk
Telephone: +44 (0)1524 593960
or, as a last resort, four paper copies should be mailed
Joe Whittaker, Program Chair
7th International Workshop on AI and Statistics
Department of Mathematics and Statistics
Lancaster University, Lancaster, LA1 4YF, England
Submissions will be considered if they are received by midnight July
1, 1998. Please indicate which topic(s) your abstract addresses. Receipt
of all submissions will be confirmed via electronic mail. Acceptance
notices will be emailed by September 1, 1998.
Please visit the URL above for details about the workshop.
Chairs,
Joe Whittaker, University of Lancaster, joe.whittaker@lancaster.ac.uk
David Heckerman, Microsoft Research, heckerma@microsoft.com
Previous
15 Next Top
Date: Tue, 30 Jun 1998 17:04:03 +0200
From: Ulrich Reimer Ulrich.Reimer@swisslife.ch
Subject: 2nd Int. Conf. on Knowledge Management: PAKM98
Web: http://research.swisslife.ch/pakm98.html
REMINDER: Call for Papers for
The Second International Conference on Practical Aspects
of Knowledge Management (PAKM98)
29-30 October, 1998
Basel, Switzerland
The Deadline is approaching: July 11, 1998
Further information
web: http://research.swisslife.ch/pakm98.html
email: Ulrich.Reimer@swisslife.ch
Previous
16 Next Top