An experimental comparison of the new goal programming and the linear programming approaches in the two-group discriminant problems
The aim of this article is to consider a new linear programming and two goal programming models for two-group classification problems. When these approaches are applied to the data of real life or of simulation, our proposed new models perform well both in separating the groups and the group–members...
Gespeichert in:
Veröffentlicht in: | Computers & industrial engineering 2006-07, Vol.50 (3), p.296-311 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 311 |
---|---|
container_issue | 3 |
container_start_page | 296 |
container_title | Computers & industrial engineering |
container_volume | 50 |
creator | Bal, Hasan Örkcü, H. Hasan Çelebioğlu, Salih |
description | The aim of this article is to consider a new linear programming and two goal programming models for two-group classification problems. When these approaches are applied to the data of real life or of simulation, our proposed new models perform well both in separating the groups and the group–membership predictions of new objects. In discriminant analysis some linear programming models determine the attribute weights and the cut-off value in two steps, but our models determine simultaneously all of these values in one step. Moreover, the results of simulation experiments show that our proposed models outperform significantly than existing linear programming and statistical approaches in attaining higher average hit-ratios. |
doi_str_mv | 10.1016/j.cie.2006.06.002 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29486720</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0360835206000350</els_id><sourcerecordid>1149897551</sourcerecordid><originalsourceid>FETCH-LOGICAL-c355t-36a87866b2dc9ab7e9f9b400683dd7a8396fbe7002c0faf677e17289d08a3f073</originalsourceid><addsrcrecordid>eNp9kUFr3DAQhUVIIZu0P6A3kUNv3o6ktSTTUwhNWwjk0p6FLI83WmzJkbxJc84fj7zbS3oIDAzifU8zjyHkM4M1Aya_7tbO45oDyPVSwE_IimnVVFDXcEpWICRUWtT8jJznvAOATd2wFXm5ChT_Tpj8iGG2A3VxnGzyOQYaezrfIw34RLexSFOK22TH0YcttaE7iIMPaNNbaSov6-4xUx8O0PwUq22K-4l2Prsyygcb5sXUDjjmj-RDb4eMn_71C_Ln5vvv65_V7d2PX9dXt5UTdT1XQlqttJQt71xjW4VN37SbkliLrlNWi0b2LaqS3UFve6kUMsV104G2ogclLsiX479l8MMe82zGsg4Ogw0Y99nwZqOl4lDAy__AXdynUHYznAm10YLXBWJHyKWYc8LeTCWZTc-GgVluYnam3MQsNzFLAS-eb0cPlpiPHpPJBQkOO5_QzaaL_h33K06tlpI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>213748325</pqid></control><display><type>article</type><title>An experimental comparison of the new goal programming and the linear programming approaches in the two-group discriminant problems</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Bal, Hasan ; Örkcü, H. Hasan ; Çelebioğlu, Salih</creator><creatorcontrib>Bal, Hasan ; Örkcü, H. Hasan ; Çelebioğlu, Salih</creatorcontrib><description>The aim of this article is to consider a new linear programming and two goal programming models for two-group classification problems. When these approaches are applied to the data of real life or of simulation, our proposed new models perform well both in separating the groups and the group–membership predictions of new objects. In discriminant analysis some linear programming models determine the attribute weights and the cut-off value in two steps, but our models determine simultaneously all of these values in one step. Moreover, the results of simulation experiments show that our proposed models outperform significantly than existing linear programming and statistical approaches in attaining higher average hit-ratios.</description><identifier>ISSN: 0360-8352</identifier><identifier>EISSN: 1879-0550</identifier><identifier>DOI: 10.1016/j.cie.2006.06.002</identifier><identifier>CODEN: CINDDL</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Classification ; Discriminant analysis ; Goal programming ; Linear programming ; Simulation ; Studies</subject><ispartof>Computers & industrial engineering, 2006-07, Vol.50 (3), p.296-311</ispartof><rights>2006 Elsevier Ltd</rights><rights>Copyright Pergamon Press Inc. Jul 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c355t-36a87866b2dc9ab7e9f9b400683dd7a8396fbe7002c0faf677e17289d08a3f073</citedby><cites>FETCH-LOGICAL-c355t-36a87866b2dc9ab7e9f9b400683dd7a8396fbe7002c0faf677e17289d08a3f073</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cie.2006.06.002$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Bal, Hasan</creatorcontrib><creatorcontrib>Örkcü, H. Hasan</creatorcontrib><creatorcontrib>Çelebioğlu, Salih</creatorcontrib><title>An experimental comparison of the new goal programming and the linear programming approaches in the two-group discriminant problems</title><title>Computers & industrial engineering</title><description>The aim of this article is to consider a new linear programming and two goal programming models for two-group classification problems. When these approaches are applied to the data of real life or of simulation, our proposed new models perform well both in separating the groups and the group–membership predictions of new objects. In discriminant analysis some linear programming models determine the attribute weights and the cut-off value in two steps, but our models determine simultaneously all of these values in one step. Moreover, the results of simulation experiments show that our proposed models outperform significantly than existing linear programming and statistical approaches in attaining higher average hit-ratios.</description><subject>Classification</subject><subject>Discriminant analysis</subject><subject>Goal programming</subject><subject>Linear programming</subject><subject>Simulation</subject><subject>Studies</subject><issn>0360-8352</issn><issn>1879-0550</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNp9kUFr3DAQhUVIIZu0P6A3kUNv3o6ktSTTUwhNWwjk0p6FLI83WmzJkbxJc84fj7zbS3oIDAzifU8zjyHkM4M1Aya_7tbO45oDyPVSwE_IimnVVFDXcEpWICRUWtT8jJznvAOATd2wFXm5ChT_Tpj8iGG2A3VxnGzyOQYaezrfIw34RLexSFOK22TH0YcttaE7iIMPaNNbaSov6-4xUx8O0PwUq22K-4l2Prsyygcb5sXUDjjmj-RDb4eMn_71C_Ln5vvv65_V7d2PX9dXt5UTdT1XQlqttJQt71xjW4VN37SbkliLrlNWi0b2LaqS3UFve6kUMsV104G2ogclLsiX479l8MMe82zGsg4Ogw0Y99nwZqOl4lDAy__AXdynUHYznAm10YLXBWJHyKWYc8LeTCWZTc-GgVluYnam3MQsNzFLAS-eb0cPlpiPHpPJBQkOO5_QzaaL_h33K06tlpI</recordid><startdate>20060701</startdate><enddate>20060701</enddate><creator>Bal, Hasan</creator><creator>Örkcü, H. Hasan</creator><creator>Çelebioğlu, Salih</creator><general>Elsevier Ltd</general><general>Pergamon Press Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20060701</creationdate><title>An experimental comparison of the new goal programming and the linear programming approaches in the two-group discriminant problems</title><author>Bal, Hasan ; Örkcü, H. Hasan ; Çelebioğlu, Salih</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c355t-36a87866b2dc9ab7e9f9b400683dd7a8396fbe7002c0faf677e17289d08a3f073</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Classification</topic><topic>Discriminant analysis</topic><topic>Goal programming</topic><topic>Linear programming</topic><topic>Simulation</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bal, Hasan</creatorcontrib><creatorcontrib>Örkcü, H. Hasan</creatorcontrib><creatorcontrib>Çelebioğlu, Salih</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers & industrial engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bal, Hasan</au><au>Örkcü, H. Hasan</au><au>Çelebioğlu, Salih</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An experimental comparison of the new goal programming and the linear programming approaches in the two-group discriminant problems</atitle><jtitle>Computers & industrial engineering</jtitle><date>2006-07-01</date><risdate>2006</risdate><volume>50</volume><issue>3</issue><spage>296</spage><epage>311</epage><pages>296-311</pages><issn>0360-8352</issn><eissn>1879-0550</eissn><coden>CINDDL</coden><abstract>The aim of this article is to consider a new linear programming and two goal programming models for two-group classification problems. When these approaches are applied to the data of real life or of simulation, our proposed new models perform well both in separating the groups and the group–membership predictions of new objects. In discriminant analysis some linear programming models determine the attribute weights and the cut-off value in two steps, but our models determine simultaneously all of these values in one step. Moreover, the results of simulation experiments show that our proposed models outperform significantly than existing linear programming and statistical approaches in attaining higher average hit-ratios.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cie.2006.06.002</doi><tpages>16</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0360-8352 |
ispartof | Computers & industrial engineering, 2006-07, Vol.50 (3), p.296-311 |
issn | 0360-8352 1879-0550 |
language | eng |
recordid | cdi_proquest_miscellaneous_29486720 |
source | Elsevier ScienceDirect Journals Complete |
subjects | Classification Discriminant analysis Goal programming Linear programming Simulation Studies |
title | An experimental comparison of the new goal programming and the linear programming approaches in the two-group discriminant problems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T17%3A28%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20experimental%20comparison%20of%20the%20new%20goal%20programming%20and%20the%20linear%20programming%20approaches%20in%20the%20two-group%20discriminant%20problems&rft.jtitle=Computers%20&%20industrial%20engineering&rft.au=Bal,%20Hasan&rft.date=2006-07-01&rft.volume=50&rft.issue=3&rft.spage=296&rft.epage=311&rft.pages=296-311&rft.issn=0360-8352&rft.eissn=1879-0550&rft.coden=CINDDL&rft_id=info:doi/10.1016/j.cie.2006.06.002&rft_dat=%3Cproquest_cross%3E1149897551%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=213748325&rft_id=info:pmid/&rft_els_id=S0360835206000350&rfr_iscdi=true |