An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order.
Ichiro SembaPublished in: J. Algorithms (1984)
Keyphrases
- initial set
- preprocessing
- dynamic programming
- optimization algorithm
- times faster
- improved algorithm
- cost function
- input pattern
- computational cost
- optimal solution
- high accuracy
- detection algorithm
- input data
- learning algorithm
- scoring function
- similarity measure
- disjoint subsets
- recognition algorithm
- matching algorithm
- computationally efficient
- k means
- experimental evaluation
- linear programming
- selected subset
- worst case
- image set
- minimum length
- search space
- segmentation algorithm
- significant improvement
- np hard
- packing problem
- lower and upper bounds
- probability distribution
- solution space
- convergence rate
- rough sets
- clustering method