WEIGHTED SEMI-SUPERVISED MANIFOLD CLUSTERING VIA SPARSE REPRESENTATION

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.

Abedi Amir; Monsefi Reza; Zabih zadeh Davood

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE)
Year:2016 | Issue:6

Download Full-Text

View:

262

Download:

Information Seminar Paper

Title

WEIGHTED SEMI-SUPERVISED MANIFOLD CLUSTERING VIA SPARSE REPRESENTATION

Author(s)

Abedi Amir | Monsefi Reza | Zabih zadeh Davood | Issue Writer Certificate

Keywords

MANIFOLD CLUSTERING

SEMI-SUPERVISED CLUSTERING

HIGH-DIMENSIONAL CLUSTERING

SPARSE REPRESENTATION

Abstract

OVER THE LAST FEW YEARS, MANIFOLD CLUSTERING HAS ATTRACTED CONSIDERABLE INTEREST IN HIGH-DIMENSIONAL DATA CLUSTERING. HOWEVER ACHIEVING ACCURATE CLUSTERING RESULTS THAT MATCH USER DESIRES AND DATA STRUCTURE IS STILL AN OPEN PROBLEM. ONE WAY TO DO SO IS INCORPORATING ADDITIONAL INFORMATION THAT INDICATE RELATION BETWEEN DATA OBJECTS. IN THIS PAPER WE PROPOSE A METHOD FOR CONSTRAINED CLUSTERING THAT TAKE ADVANTAGE OF PAIRWISE CONSTRAINTS. IT FIRST SOLVES AN OPTIMIZATION PROGRAM TO CONSTRUCT AN AFFINITY MATRIX ACCORDING TO PAIRWISE CONSTRAINTS AND MANIFOLD STRUCTURE OF DATA, THEN APPLIES SPECTRAL CLUSTERING TO FIND DATA CLUSTERS. EXPERIMENTS DEMONSTRATED THAT OUR ALGORITHM OUTPERFORMS OTHER RELATED ALGORITHMS IN FACE IMAGE DATASETS AND HAS COMPARABLE RESULTS ON HAND-WRITTEN DIGIT DATASETS.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Abedi, Amir, Monsefi, Reza, & Zabih zadeh, Davood. (2016). WEIGHTED SEMI-SUPERVISED MANIFOLD CLUSTERING VIA SPARSE REPRESENTATION. INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE). SID. https://sid.ir/paper/944572/en

Vancouver: Copy

Abedi Amir, Monsefi Reza, Zabih zadeh Davood. WEIGHTED SEMI-SUPERVISED MANIFOLD CLUSTERING VIA SPARSE REPRESENTATION. 2016. Available from: https://sid.ir/paper/944572/en

IEEE: Copy

Amir Abedi, Reza Monsefi, and Davood Zabih zadeh, “WEIGHTED SEMI-SUPERVISED MANIFOLD CLUSTERING VIA SPARSE REPRESENTATION,” presented at the INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE). 2016, [Online]. Available: https://sid.ir/paper/944572/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops