Efficient Global Programming Model for Discriminant Analysis

Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 3

Abstract

Conventional statistical analysis includes the capacity to systematically assign individuals to groups. We suggest alternative assignment procedures, utilizing a set of interrelated goal programming formulations. This paper represents an effort to suggest ways by which the discriminant problem might reasonably be addressed via straightforward linear goal programming formulations. Simple and direct, such formulations may ultimately compete with conventional approaches - free of the classical assumptions and possessing a stronger intuitive appeal. We further demonstrate via simple illustration the potential of these procedures to play a significant part in addressing the discriminant problem, and indicate fundamental ideas that lay the foundation for other more sophisticated approaches.

Authors and Affiliations

M. ANGULAKSHMI,

Keywords

Related Articles

An Incremental framework for a Thai-English Machine Translation System using a LFG tree structure as an Interlingua

Abstract—Developing a machine translation system which can correctly translate any sentence from one language to another is a formidable and challenging task. This suggests that such a system should be implemented increm...

Educational Approach of Refactoring in Facilitating Reverse Engineering

Refactoring improves software codes and design. This activity often neglected by software developers because they need time to decide tactically where and when to refactor codes. Although the concepts theoretically insti...

An Efficient Clustering Technique for Message Passing Between Data Points using Affinity Propagation

A wide range of clustering algorithms is available in literature and still an open area for researcher’s k-means algorithm is one of the basic and most simple partitioning clustering technique is given by Macqueen in 196...

Implementing Ant Colony Optimization for Test Case Selection and Prioritization

Regression Testing is an inevitable and a very costly activity to be performed, often in a time and resource constrained environment. Thus we use techniques like Test Case Selection and Prioritization, to select and prio...

Routing in Highly Dynamic Ad Hoc Networks: Issues and Challenges

The aim of this research paper is to analyze the various issues and challenges involved in routing of data packets in highly mobile ad hoc networks. Routing in ad hoc networks has always been a challenging and tough task...

Download PDF file
  • EP ID EP124275
  • DOI -
  • Views 96
  • Downloads 0

How To Cite

M. ANGULAKSHMI, (2011). Efficient Global Programming Model for Discriminant Analysis. International Journal on Computer Science and Engineering, 3(3), 1319-1326. https://europub.co.uk/articles/-A-124275