Nautilus Systems, Inc. logo and menu bar Site Index Home
News Books
Button Bar Menu- Choices also at bottom of page About Nautilus Services Partners Case Studies Contact Us
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index] [Subscribe]

DM: Pointers in K-NN for temporal data


From: Innaki Inza Cano
Date: Tue, 22 Dec 1998 09:10:47 -0500 (EST)
        Dear dataminers!
        Has anyone ideas or pointers about the use of nearest-neighbor
algorithm with temporal data? Are there specific nearest-neighbor
algorithms when data present a temporal organization & structure? 
        Can anyone help us? 
        Thanks in advance. Best regards for the new year. 

********************************************************************
Inaki Inza
Computer Sciences and Artificial Intelligence Department
University of the Basque Country
P.O. Box 649
E-20080 Donostia - San Sebastian
Basque Country
Spain

Telephone number: (+34) 943448000 (extension 5106)
FAX number: (+34) 943219306
e-mail: ccbincai@si.ehu.es
********************************************************************








[ Home | About Nautilus | Case Studies | Partners | Contact Nautilus ]
[ Subscribe to Lists | Recommended Books ]

logo Copyright © 1998 Nautilus Systems, Inc. All Rights Reserved.
Email: nautilus-info@nautilus-systems.com
Mail converted by MHonArc 2.2.0