Making a shallow network deep: Conversion of a boosting classifier into a decision tree by boolean optimisation

This paper presents a novel way to speed up the evaluation time of a boosting classifier. We make a shallow (flat) network deep (hierarchical) by growing a tree from decision regions of a given boosting classifier. The tree provides many short paths for speeding up while preserving the reasonably smooth decision regions of the boosting classifier for good generalisation. For converting a boosting classifier into a decision tree, we formulate a Boolean optimization problem, which has been previously studied for circuit design but limited to a small number of binary variables. In this work, a novel optimisation method is proposed for, firstly, several tens of variables i.e. weak-learners of a boosting classifier, and then any larger number of weak-learners by using a two-stage cascade. Experiments on the synthetic and face image data sets show that the obtained tree achieves a significant speed up both over a standard boosting classifier and the Fast-exit-a previously described method for speeding-up boosting classification, at the same accuracy. The proposed method as a general meta-algorithm is also useful for a boosting cascade, where it speeds up individual stage classifiers by different gains. The proposed method is further demonstrated for fast-moving object tracking and segmentation problems. © 2011 Springer Science+Business Media, LLC.

stochastic process algebra based software process simulation modeling

Chinese Acad Sci, ISCAS Lab Internet Software Technologies

Relation algebra operations on formal contexts.

This paper discusses the use of relation algebra operations on formal contexts. These operations are a generalisation of some of the context operations that are described in the standard FCA textbook (Ganter & Wille, 1999). This paper extends previous research in this area with respect to applications and implementations. It also describes a software tool (FcaFlint) which in combination with FcaStone facilitates the application of relation algebra operations to contexts stored in many formats.

Algebra Llinol - Cyflwyniad

Cyfieithiad yw'r llyfr hwn o Linear Algebra - An Introduction a ymddangosodd gyntaf yn 1978 ac a gyhoeddwyd gan y cwmni Van Nostrand Reinhold. Cafwyd Ail Argraffiad yn 1982 a dros y blynyddoedd bu nifer o ail brintiadau. Yn y cyfamser cyfieithwyd y llyfr i'r Groeg a Thwrceg. Er i'r llyfr gael ei ddefnyddio dros y blynyddoedd gan nifer o fyfyrwyr yn Aberystwyth a oedd yn cyflwyno eu gwaith yn Gymraeg, nid oedd ar gael yn y Gymraeg. Dyma, o'r diwedd, ymgais i wneud rhyw fath o iawn am hynny. Er bod y llyfr wedi bod allan o brint yn y Saesneg ers rhai blynyddoedd yn awr, mae'n amlwg ei fod yn dal i gael ei gymeradwyo mewn nifer o brifysgolion. Felly, y gobaith yw y bydd o ddefnydd. Efallai mai'r peth nesaf bydd ei gyfiethu'n ?l i'r Saesneg! Mae nifer o newidiadau yn y fersiwn hwn. Mae'n siwr bod nifer o gamgymeriadau ac efallai gwelliannau posibl i'r cyfieithu - byddwn yn ddiolchgar dderbyn unrhyw awgrymiadau. Gellir eu cyflwyno hefyd drwy Dr Gwion Evans o'r Adran Fathemateg, Prifysgol Aberystwyth.

A Biomechanical Model of Human Oculomotor Plant Kinematics Based Upon Geometric Algebra

A biomechanical model of the human oculomotor plant kinematics in 3-D as a function of muscle length changes is presented. It can represent a range of alternative interpretations of the data as a function of one parameter. The model is free from such deficits as singularities and the nesting of axes found in alternative formulations such as the spherical wrist (Paul, l98l). The equations of motion are defined on a quaternion based representation of eye rotations and are compact atnd computationally efficient.