Academic
Publications
Pattern Classification Using Linear Programming

Pattern Classification Using Linear Programming,10.1287/ijoc.3.1.66,Informs Journal on Computing,Asim Roy,Somnath Mukhopadhyay

Pattern Classification Using Linear Programming   (Citations: 11)
BibTex | RIS | RefWorks Download
Journal: Informs Journal on Computing - INFORMS , vol. 3, no. 1, pp. 66-80, 1991
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...For example, the polynomialtime-trained hyperspherical classifier presented in [7] and [8] and the restricted Coulomb energy algorithm presented in [6] and [14] are neural networks using some distance function as their node functions...

    Ling Zhanget al. A geometrical representation of McCulloch-Pitts neural model and its a...

    • ...The methods of Roy et al. [26, 25, 24] use clustering in conjunction with LP to generate neural networks in polynomial time...

    Erin J. Bredensteineret al. Multicategory Classification by Support Vector Machines

    • ...All of the previous algorithms [22], [31]‐[33], based on these learning principles, were for classification...

    Asim Royet al. A neural-network learning theory and a polynomial time RBF algorithm

    • ...All of the previous methods for generating neural networks in polynomial time ([21], [24]‐[27]) use some form of clustering in conjunction with linear programming (LP) models to generate the networks [higher -order perceptrons, radial basis function (RBF) nets]...
    • ...Roy et al. [24], [25], [27] use a certain type of nonlinear function to obtain such nonlinear separation...
    • ...The masking procedure actually generates a multilayer perceptron as shown in [21], [24], and [25]...
    • ...Remarks: The LP model used in [21], [24], and [25] is different from the one used here...
    • ...The LP model used here minimizes the weighted sum of the deviations, whereas the one in [21], [24], and [25] attempts to find whether a certain linear or nonlinear separating plane can separate two sets of patterns, belonging to two different classes, completely...
    • ...By comparison, the algorithm of Roy et al. [24], [25] and Mukhopadhyay et al. [21] requires 14 masks for a seven-bit parity and 28 for an eight-bit parity...

    Asim Royet al. Iterative generation of higher-order nets in polynomial time using lin...

    • ...Tesauro and Janssens (1988) also used 2N hidden units to overcome the local minimum problem...

    Somnath Mukhopadhyayet al. A Polynomial Time Algorithm for Generating Neural Networks for Pattern...

Sort by: