Sciweavers

2080 search results - page 276 / 416
» Measuring empirical computational complexity
Sort
View
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 6 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
VLDB
1998
ACM
192views Database» more  VLDB 1998»
15 years 10 months ago
Algorithms for Mining Distance-Based Outliers in Large Datasets
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...
Edwin M. Knorr, Raymond T. Ng
AAAI
2007
15 years 8 months ago
The VITA Financial Services Sales Support Environment
Knowledge-based recommender technologies support customers and sales representatives in the identification of appropriate products and services. These technologies are especially ...
Alexander Felfernig, Klaus Isak, Kalman Szabo, Pet...
JAIR
2006
90views more  JAIR 2006»
15 years 6 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
INFOCOM
2011
IEEE
14 years 9 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...