The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Although supervised learning has been widely used to tackle problems of function approximation and regression estimation, prior knowledge fails to be incorporated into the data-driven approach because the form of input-output data pairs are not applied. To overcome this limitation, focusing on the fusion between rough fuzzy system and very rare samples of input-output pairs with noise, this paper...
In this paper, an efficient feature extraction method named as Constrained Maximum Variance Mapping (CMVM) is developed for dimensionality reduction. The proposed algorithm can be viewed as a linear approximation of multi-manifolds based learning approach, which takes the local geometry and manifold labels into account. After the local scatters have been characterized, the proposed method focuses...
Gaussian processes is a very promising novel technology that has been applied for both the regression problem and the classification problem. While for the regression problem it yields simple exact solutions, this is not the case for the classification case. The reason is that we encounter intractable integrals. In this paper we propose a new approximate solution for the Gaussian process classification...
We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and a simple plug-in mechanism to extend existing central clustering algorithms to graphs. Experiments in clustering protein structures show the benefits of the proposed theory.
Non-negative sparse coding (NSC) is a powerful technique for low-rank data approximation, and has found several successful applications in signal processing. However, the temporal dependency, which is a vital clue for many realistic signals, has not been taken into account in its conventional model. In this paper, we propose a general framework, i.e., convolutive non-negative sparse coding (CNSC),...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.