Sciweavers

1529 search results - page 126 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
PRL
2010
159views more  PRL 2010»
15 years 2 months ago
Creating diverse nearest-neighbour ensembles using simultaneous metaheuristic feature selection
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
Muhammad Atif Tahir, Jim E. Smith
EDBT
2002
ACM
120views Database» more  EDBT 2002»
16 years 4 months ago
Hyperdatabases: Infrastructure for the Information Space
The amount of stored information is exploding while, at the same time, tools for accessing relevant information are rather under-developed. Usually, all users have a pre-defined vi...
Hans-Jörg Schek
STRINGOLOGY
2004
15 years 5 months ago
Sorting suffixes of two-pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
Frantisek Franek, William F. Smyth
KDD
2008
ACM
134views Data Mining» more  KDD 2008»
16 years 4 months ago
Privacy-preserving cox regression for survival analysis
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...
DATAMINE
1999
143views more  DATAMINE 1999»
15 years 4 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...