Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Otman A. Basir

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Cecille Freeman

> Home > Persons > Otman A. Basir

Publications

2015
[j37]
- view
  authority control:
- export record
  dblp key:
  - journals/pr/FreemanKB15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pr/FreemanKB15
Cecille Freeman, Dana Kulic, Otman A. Basir:
An evaluation of classifier-specific filter measure performance for feature selection. Pattern Recognit. 48(5): 1812-1826 (2015)
2013
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/tcyb/FreemanKB13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcyb/FreemanKB13
Cecille Freeman, Dana Kulic, Otman Basir:
Feature-Selected Tree-Based Classification. IEEE Trans. Cybern. 43(6): 1990-2004 (2013)
[c72]
- view
  authority control:
- export record
  dblp key:
  - conf/icmla/FreemanKB13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icmla/FreemanKB13
Cecille Freeman, Dana Kulic, Otman Basir:
Multi-modal Tree-Based SVM Classification. ICMLA (1) 2013: 65-71
2011
[c66]
- view
  authority control:
- export record
  dblp key:
  - conf/smc/FreemanKB11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/smc/FreemanKB11
Cecille Freeman, Dana Kulic, Otman Basir:
Joint feature selection and hierarchical classifier design. SMC 2011: 1728-1734

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.