Sciweavers

7581 search results - page 1364 / 1517
» Incompleteness in Data Mining
Sort
View
FLAIRS
2004
15 years 5 months ago
The Optimality of Naive Bayes
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...
Harry Zhang
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
15 years 5 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
SDM
2004
SIAM
214views Data Mining» more  SDM 2004»
15 years 5 months ago
Making Time-Series Classification More Accurate Using Learned Constraints
It has long been known that Dynamic Time Warping (DTW) is superior to Euclidean distance for classification and clustering of time series. However, until lately, most research has...
Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh
SIGCOMM
2010
ACM
15 years 4 months ago
Detecting the performance impact of upgrades in large operational networks
Networks continue to change to support new applications, improve reliability and performance and reduce the operational cost. The changes are made to the network in the form of up...
Ajay Anil Mahimkar, Han Hee Song, Zihui Ge, Aman S...
AAI
2007
132views more  AAI 2007»
15 years 4 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
« Prev « First page 1364 / 1517 Last » Next »