SEMI SUPERVISED MULTIPLE KERNEL LEARNING USING DISTANCE METRIC LEARNING TECHNIQUES

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ZARE BIDOKI TAHEREH; SADEGHI MOHAMMAD TAGHI; ABUTALEBI HAMID REZA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SIGNAL AND DATA PROCESSING Year:2017 | Volume:14 | Issue:1 SERIAL 31) Page(s): 53-70

Download Full-Text

Persian Verion

View:

1,105

Download:

Cites:

Information Journal Paper

Title

SEMI SUPERVISED MULTIPLE KERNEL LEARNING USING DISTANCE METRIC LEARNING TECHNIQUES

Author(s)

ZARE BIDOKI TAHEREH | SADEGHI MOHAMMAD TAGHI | ABUTALEBI HAMID REZA | Issue Writer Certificate

Keywords

DISTANCE METRIC LEARNINGQ1

MULTIPLE KERNEL LEARNINGQ1

SIMILARITY PAIRSQ1

DISSIMILARITY PAIRSQ1

SEMI SUPERVISEDQ1

Abstract

Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, DISTANCE METRIC LEARNING using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown that DISTANCE METRIC LEARNING-based algorithms considerably outperform the commonly used distance metrics such as Euclidean distance. In the kernelized version of the metric learning algorithms, the data points are implicitly mapped into a new feature space using a non-linear kernel function. The associated distance metric is then learned in this new feature space. Utilizing kernel function improves the performance of pattern recognition algorithms, however choosing a proper kernel and tuning its parameter(s) are the main issues in such methods. Using of an appropriate composite kernel instead of a single kernel is one of the best solutions to this problem. In this research study, a multiple kernel is constructed using the weighted sum of a set of basis kernels. In this framework, we propose different learning approaches to determine the kernels weights. The proposed learning techniques arise from the DISTANCE METRIC LEARNING concepts. These methods are performed within a SEMI SUPERVISED framework where different cost functions are considered and the learning process is performed using a limited amount of supervisory information. The supervisory information is in the form of a small set of similarity and/or DISSIMILARITY PAIRS. We define four distance metric based cost functions in order to optimize the multiple kernel weight. In the first structure, the average distance between the SIMILARITY PAIRS is considered as the cost function. The cost function is minimized subject to maximizing of the average distance between the DISSIMILARITY PAIRS. This is in fact, a commonly used goal in the DISTANCE METRIC LEARNING problem. In the next structure, it is tried to preserve the topological structure of the data by using of the idea of graph Laplacian. For this purpose, we add a penalty term to the cost function which preserves the topological structure of the data. This penalty term is also used in the other two structures. In the third arrangement, the effect of each dissimilarity pair is considered as an independent constraint. Finally, in the last structure, maximization of the distance between the DISSIMILARITY PAIRS is considered within the cost function not as a constraint. The proposed methods are examined in the clustering application using the kernel k-means clustering algorithm. Both synthetic (a XOR data set) and real data sets (the UCI data) used in the experiments and the performance of the clustering algorithm using single kernels, are considered as the baseline. Our experimental results confirm that using the multiple kernel not only improves the clustering result but also makes the algorithm independent of choosing the best kernel. The results also show that increasing of the number of constraints, as in the third structures, leads to instability of the algorithm which is expected.

Cites

No record.

References

No record.

Cite

APA: Copy

ZARE BIDOKI, TAHEREH, SADEGHI, MOHAMMAD TAGHI, & ABUTALEBI, HAMID REZA. (2017). SEMI SUPERVISED MULTIPLE KERNEL LEARNING USING DISTANCE METRIC LEARNING TECHNIQUES. SIGNAL AND DATA PROCESSING, 14(1 SERIAL 31) ), 53-70. SID. https://sid.ir/paper/160733/en

Vancouver: Copy

ZARE BIDOKI TAHEREH, SADEGHI MOHAMMAD TAGHI, ABUTALEBI HAMID REZA. SEMI SUPERVISED MULTIPLE KERNEL LEARNING USING DISTANCE METRIC LEARNING TECHNIQUES. SIGNAL AND DATA PROCESSING[Internet]. 2017;14(1 SERIAL 31) ):53-70. Available from: https://sid.ir/paper/160733/en

IEEE: Copy

TAHEREH ZARE BIDOKI, MOHAMMAD TAGHI SADEGHI, and HAMID REZA ABUTALEBI, “SEMI SUPERVISED MULTIPLE KERNEL LEARNING USING DISTANCE METRIC LEARNING TECHNIQUES,” SIGNAL AND DATA PROCESSING, vol. 14, no. 1 SERIAL 31) , pp. 53–70, 2017, [Online]. Available: https://sid.ir/paper/160733/en

Related Journal Papers