SCHEDULING
2010
13 years 6 months ago
2010
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
SCHEDULING
2010
13 years 6 months ago
2010
SADM
2010
13 years 6 months ago
2010
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
SADM
2010
13 years 6 months ago
2010
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
SADM
2010
13 years 6 months ago
2010
SADM
2010
13 years 6 months ago
2010
: The traditional latent class analysis (LCA) uses a mixture model with binary responses on each subject that are independent conditional on cluster membership. However, in many pr...
SAC
2010
ACM
13 years 6 months ago
2010
ACM
The label switching problem is caused by the likelihood of a Bayesian mixture model being invariant to permutations of the labels. The permutation can change multiple times betwee...
SAC
2010
ACM
13 years 6 months ago
2010
ACM
SAC
2010
ACM
13 years 6 months ago
2010
ACM
Associative classification is a rule-based approach to classify data relying on association rule mining by discovering associations between a set of features and a class label. Su...
SAC
2010
ACM
13 years 6 months ago
2010
ACM
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...