Clustering and combinatorial optimization in recursive supervised learning
- Author
- RAMANATHAN, Kiruthika1 ; SHENG UEI GUAN1
[1] Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore - Source
Journal of combinatorial optimization. 2007, Vol 13, Num 2, pp 137-152, 16 p ; ref : 3/4 p
- ISSN
- 1382-6905
- Scientific domain
- Control theory, operational research; Mathematics
- Publisher
- Springer, Norwell, MA
- Publication country
- United States
- Document type
- Article
- Language
- English
- Author keyword
- Evolutionary algorithms Neural networks Recursive learning Task decomposition Topology based selection
- Keyword (fr)
- Ajustement courbe Algorithme apprentissage Algorithme génétique Algorithme évolutionniste Amas Apprentissage supervisé Chauffe appoint Classificateur Classification Méthode empirique Méthode récursive Optimisation combinatoire Problème combinatoire Rayonnage Réseau neuronal Topologie
- Keyword (en)
- Curve fitting Learning algorithm Genetic algorithm Evolutionary algorithm Cluster Supervised learning Boosting Classifier Classification Empirical method Recursive method Combinatorial optimization Combinatorial problem Shelf Neural network Topology
- Keyword (es)
- Ajustamiento curva Algoritmo aprendizaje Algoritmo genético Algoritmo evoluciónista Montón Aprendizaje supervisado Calentamiento complementario Clasificador Clasificación Método empírico Método recursivo Optimización combinatoria Problema combinatorio Anaquelería Red neuronal Topología
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 18462005
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1007/s10878-006-9017-5 
https://dx.doi.org/10.1007/s10878-006-9017-5
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10878-006-9017-5\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"137\";s:8:\"\u0000*\u0000epage\";s:3:\"152\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"RAMANATHAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Kiruthika\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHENG UEI GUAN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10878-006-9017-5\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"137\";s:8:\"\u0000*\u0000epage\";s:3:\"152\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"RAMANATHAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Kiruthika\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHENG UEI GUAN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10878-006-9017-5\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10878-006-9017-5\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"137\";s:8:\"\u0000*\u0000epage\";s:3:\"152\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"RAMANATHAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Kiruthika\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHENG UEI GUAN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10878-006-9017-5\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"137\";s:8:\"\u0000*\u0000epage\";s:3:\"152\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"RAMANATHAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Kiruthika\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHENG UEI GUAN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10878-006-9017-5\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:2:\"13\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"137\";s:8:\"\u0000*\u0000epage\";s:3:\"152\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"RAMANATHAN\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Kiruthika\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHENG UEI GUAN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"Clustering and combinatorial optimization in recursive supervised learning\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
