| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Nomor Edisi | : | X-2, PEBRUARI (No. 2) |
| Nomor Halaman | : | 95-111 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Nomor Edisi | : | 11 (No. 4) |
| Nomor Halaman | : | 36-45 |
| Abstraksi Narasi | : | In several applications, input samples are more nat- urally represented in terms of similarities between each other, rather than in terms of feature vectors. machine-learning In these settings. algorithms ally demanding, can become very computation- as they may require matching the test samples against a very large set of reference prototypes. To mitigate this issue, different approaches have been developed to reduce the number of required reference prototypes. approaches select Current reduction a small subset of representative prototypes in the space induced by the similarity measure, and then sepa- rately train the classification function on the reduced subset. However, decoupling these two steps may not allow reducing the number of prototypes effectively without accuracy. We compromising overcome this limitation by jointly learning the classification function along with an optimal set of virtual pro- totypes, whose number can be either fixed a priori or opti- mized according to application-specific criteria. Creating a super-sparse set of virtual prototypes solutions, drastically provides much sparser reducing complexity expense of a slightly at test time, at the increased complexity much smaller set of prototypes during training. A pret decisions. also results in easier-to-inter- We empirically show that our approach can reduce up to ten times the complexity of Support Vector Machines, LASSO and ridge regression almost affecting at test time, without their classification accuracy. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Nomor Edisi | : | X-2, PEBRUARI (No. 2) |
| Nomor Halaman | : | 83-94 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Muñoz-Romero, Sergio,Gómez-Verdejo, Vanessa,Arenas-Garcia, Jerónimo |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Nomor Edisi | : | 11 (No. 4) |
| Nomor Halaman | : | 24-35 |
| Abstraksi Narasi | : | Multivariate Analysis (MVA) comprises a family of well-known methods for feature extraction which exploit correlations among input variables representing the data. One important property that is enjoyed by most such methods is uncorrelation among the extracted features. Recently, regularized versions of MVA methods have appeared in the literature, mainly with the goal to gain interpretability of the solution. In these cases, the solutions can no longer be obtained in a closed manner, and more complex optimization methods that rely on the iteration of two steps are frequently used. This paper recurs to an alternative approach to solve efficiently this iterative problem. The main novelty of this approach lies in preserving several properties of the original methods, most notably the uncorrelation of the extracted features. Under this framework, we proposea novel method that takes advantage of the 2,1 norm to perform variable selection during the feature extraction process. Experimental results over different problems corroborate the advantages of the proposed formulation in comparison to state of the art formulations. |
| Nama Pengarang | : | Giri, Ritwik,Rao, Bhaskar |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Nomor Edisi | : | 11 (No. 4) |
| Nomor Halaman | : | 14-23 |
| Abstraksi Narasi | : | Power Exponential Scale Mixture (PESM), a generalized scale mixture family of distributions, has been recently proposed to model the sparsity inducing prior distributions currently in use for Sparse Signal Recovery (SSR). In this paper, we review this generalized scale mixture family and establish the necessary and sufficient condition for a distribution (symmetric with respect to origin) to have a PESM representation, which is a generalization of the results previously known for the Gaussian Scale Mixture (GSM) family. On the algorithmic front, we propose an adaptive Bayesian Sparse Signal Recovery (B-SSR) framework by learning the distributional parameters of a Generalized t-distribution (GT) which belongs to the PESM family. For specific choice of distributional parameters of GT our proposed framework corresponds to popular sparse recovery algorithms such as, LASSO, Reweighted 1 norm minimization, Reweighted l2 norm minimization etc. The tail nature of GT distribution family is extensively studied in this paper and an adaptive algorithm has been proposed where the tail nature of the prior is adapted over iterations based on the observation. Extensive experimental results based on traditional SSR setup have also been presented to show the efficacy of this adaptive approach. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Nomor Edisi | : | 11 (No. 4) |
| Nomor Halaman | : | 12-13 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Haibo He,Chin-Teng Lin,Kay Chen Tan,Kendall, Graham,Yaochu Jin |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Nomor Edisi | : | 11 (No. 4) |
| Nomor Halaman | : | 8-10 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Endi Rukmo |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Nomor Edisi | : | X-12, DESEMBER (No. 12) |
| Nomor Halaman | : | 1108-1116 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Nomor Edisi | : | X-12, DESEMBER (No. 12) |
| Nomor Halaman | : | 1090-1107 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Alfian Muthalib |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Nomor Edisi | : | X-12, DESEMBER (No. 12) |
| Nomor Halaman | : | 1076-1089 |
| Abstraksi Narasi | : | - |