Sciweavers

1285 search results - page 79 / 257
» On the Complexity of Ordinal Clustering
Sort
View
TKDE
2002
133views more  TKDE 2002»
13 years 8 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 3 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
ACSC
2005
IEEE
14 years 2 months ago
Unsupervised Anomaly Detection in Network Intrusion Detection Using Clusters
Most current network intrusion detection systems employ signature-based methods or data mining-based methods which rely on labelled training data. This training data is typically ...
Kingsly Leung, Christopher Leckie
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
14 years 2 months ago
Post-processing clustering to reduce XCS variability
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
Flavio Baronti, Alessandro Passaro, Antonina Stari...
HPCC
2005
Springer
14 years 2 months ago
Transactional Cluster Computing
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional...
Stefan Frenz, Michael Schöttner, Ralph Gö...