Sciweavers

130 search results - page 1 / 26
» Making Better Use of Global Discretization
Sort
View
ICML
1999
IEEE
14 years 5 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten
EVOW
2009
Springer
13 years 11 months ago
Discrete Particle Swarm Optimization for Multiple Destination Routing Problems
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
Zhi-hui Zhan, Jun Zhang
ISCI
2008
166views more  ISCI 2008»
13 years 4 months ago
A discretization algorithm based on Class-Attribute Contingency Coefficient
Discretization algorithms have played an important role in data mining and knowledge discovery. They not only produce a concise summarization of continuous attributes to help the ...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 4 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
WSC
2008
13 years 6 months ago
Discrete Rate Simulation using linear programming
Discrete Rate Simulation (DRS) is a modeling methodology that uses event based logic to simulate linear continuous processes and hybrid systems. These systems are concerned with t...
Cecile Damiron, Anthony Nastasi