Complexity vs. performance in granular embedding spaces for graph classification

The most distinctive trait in structural pattern recognition in graph domain is the ability to deal with the organization and relations between the constituent entities of the pattern. Even if this can be convenient and/or necessary in many contexts, most of the state-of the art classi\ufb01cation techniques can not be deployed directly in the graph domain without \ufb01rst embedding graph patterns towards a metric space. Granular Computing is a powerful information processing paradigm that can be employed in order to drive the synthesis of automatic embedding spaces from structured domains. In this paper we investigate several classi\ufb01cation techniques starting from Granular Computing-based embedding procedures and provide a thorough overview in terms of model complexity, embedding space complexity and performances on several open-access datasets for graph classi\ufb01cation. We witness that certain classi\ufb01cation techniques perform poorly both from the point of view of complexity and learning performances as the case of non-linear SVM, suggesting that high dimensionality of the synthesized embedding space can negatively affect the effectiveness of these approaches. On the other hand, linear support vector machines, neuro-fuzzy networks and nearest neighbour classi\ufb01ers have comparable performances in terms of accuracy, with second being the most competitive in terms of structural complexity and the latter being the most competitive in terms of embedding space dimensionality

Study on identification of nonlinear systems using Quasi-ARX models

制度:新 ; 報告番号:甲3660号 ; 学位の種類:博士(工学) ; 授与年月日:2012/9/15 ; 早大学位記番号:新6026Waseda Universit

Viabilist and Tychastic Approaches to Guaranteed ALM Problem.

This study reconsiders the problem of hedging a liability by a portfolio made of a riskless asset and an underlying (underlying).Asset and Liability Management; Viability theory;

Application of Multiple Kernel Support Vector Regression for Weld Bead Geometry Prediction in Robotic GMAWProcess

Modelling and prediction of weld bead geometry is an important issue in robotic GMAW process. This process is highly non-linear and coupled multivariable system and the relationship between process parameters and weld bead geometry cannot be defined by an explicit mathematical expression. Therefore, application of supervised learning algorithms can be useful for this purpose. Support vector machine is a very successful approach to supervised learning. In this approach, a higher degree of accuracy and generalization capability can be obtained by using the multiple kernel learning framework, which is considered as a great advantage in prediction of weld bead geometry due to the high degree of prediction accuracy required. In this paper, a novel approach for modelling and prediction of the weld bead geometry, based on multiple kernel support vector regression analysis has been proposed, which benefits from a high degree of accuracy and generalization capability. This model can be used for proper selection of welding parameters in order to obtain a desired weld bead geometry in robotic GMAW process

Multicriteria decision making for enhanced perception-based multimedia communication

This paper proposes an approach that integrates technical concerns with user perceptual considerations for intelligent decision making in the construction of tailor-made multimedia communication protocols. Thus, the proposed approach, based on multicriteria decision making (MDM), incorporates not only classical networking considerations, but, indeed, user preferences as well. Furthermore, in keeping with the task-dependent nature consistently identified in multimedia scenarios, the suggested communication protocols also take into account the type of multimedia application that they are transporting. Lastly, this approach also opens the possibility for such protocols to dynamically adapt based on a changing operating environment and user's preferences

A bilateral schema for interval-valued image differentiation

Differentiation of interval-valued functions is an intricate problem, since it cannot be defined as a direct generalization of differentiation of scalar ones. Literature on interval arithmetic contains proposals and definitions for differentiation, but their semantic is unclear for the cases in which intervals represent the ambiguity due to hesitancy or lack of knowledge. In this work we analyze the needs, tools and goals for interval-valued differentiation, focusing on the case of interval-valued images. This leads to the formulation of a differentiation schema inspired by bilateral filters, which allows for the accommodation of most of the methods for scalar image differentiation, but also takes support from interval-valued arithmetic. This schema can produce area-, segment-and vector-valued gradients, according to the needs of the image processing task it is applied to. Our developments are put to the test in the context of edge detection