A Parallel Algorithm of Selecting the Best Subset on Cρ Criterion
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The Cρ criterion[l] is recently paid much attention to as an important one of variable selection. A parallel algorithm and the number of operations (multiplications and divisions) of selecting the best subset from a11 possible subsets,with regard to a large-scale linear regression model under Cρ criterion,are presented. The simulation results for the algorithm on the vector super-computers YH-1 and YH-2 are given. The vector speed-up,ratio,s/v, approximates to fifteen and the advantages of the algorithm are shown.

    Reference
    Related
    Cited by
Get Citation

Hu Qingjun, Wu Yi. A Parallel Algorithm of Selecting the Best Subset on Cρ Criterion[J]. Journal of National University of Defense Technology,1993,15(2):94-98.

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 16,1991
  • Revised:
  • Adopted:
  • Online: January 23,2015
  • Published:
Article QR Code