<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/2984444B-A718-4A85-AA4B-C31C8F018C42"><efrbr-work:titleOfTheWork>Nearest neighbor based pap smear cell classification using tabu search for feature selection</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/2984444B-A718-4A85-AA4B-C31C8F018C42"><efrbr-expression:titleOfTheExpression>Nearest neighbor based pap smear cell classification using tabu search for feature selection</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-06</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2006</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent> The problem of classification consists of using some known objects, usually described by a large vector of features, to induce a model that classifies others into known classes. Selecting the right set of features for classification is one of the most important problems in designing a good classifier. In this paper, a tabu search algorithm is proposed for the solution of the feature selection problem. Tabu Search is a well known and effective metaheuristic algorithm that was first introduced for the solution of combinatorial optimization problems. This algorithm is combined with a number of nearest neighbor based classifiers. The algorithm is tested in two sets of data for Pap-Smear Cell Classification. The first one consists of 917 images of Pap smear cells and the second set consists of 500 images, classified carefully by cyto-technicians and doctors. Each cell is described by 20 features, and the cells fall into 7 classes but a minimal requirement is to separate normal from abnormal cells, which is a 2 class problem.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="page range">25-34</efrbr-expression:note><efrbr-expression:note type="conference name"> 2nd European Symposium on Nature-inspired Smart Information Systems</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~imarinakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Marinakis Ioannis
            Μαρινακης Ιωαννης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://viaf.org/viaf/78906664"><efrbr-person:nameOfPerson vocabulary="VIAF">
            Dounias, G
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-concept:concept identifier="http://id.loc.gov/authorities/subjects/sh85097526"><efrbr-concept:termForTheConcept>
            Pap smear
            Papanicolaou smear
            Papanicolaou test
            pap test
            pap smear
            papanicolaou smear
            papanicolaou test
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/2984444B-A718-4A85-AA4B-C31C8F018C42" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/2984444B-A718-4A85-AA4B-C31C8F018C42"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/2984444B-A718-4A85-AA4B-C31C8F018C42" targetEntity="person" targetURI="http://users.isc.tuc.gr/~imarinakis"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/2984444B-A718-4A85-AA4B-C31C8F018C42" targetEntity="person" targetURI="http://users.isc.tuc.gr/~imarinakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/2984444B-A718-4A85-AA4B-C31C8F018C42" targetEntity="person" targetURI="http://viaf.org/viaf/78906664" role="author"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/2984444B-A718-4A85-AA4B-C31C8F018C42" targetEntity="concept" targetURI="http://id.loc.gov/authorities/subjects/sh85097526"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>