{"id":{"repo_id":"colo-mines","oai_identifier":"oai:repository.mines.edu:11124/173087"},"canonical_url":"https://search.dev.ndltd.org/etd/colo-mines/oai:repository.mines.edu:11124/173087","repository":{"repo_id":"colo-mines","name":"Colorado School of Mines","base_url":"https://repository.mines.edu/server/oai/request"},"display":{"title":"Learning strictly orthogonal p-order nonnegative Laplacian embedding via smoothed iterative reweighted method","abstract":"Laplacian embedding is a powerful graph based method with its ability in spectral clustering to reveal the intrinsic geometry of data in the high dimensional space. Imposing the orthogonality and the nonnegativity constraints can avoid degenerate and negative solutions, respectively. These two attributes are critical yet challenging to achieve simultaneously. Although, in recent years, many attempts have been made to overcome this, this problem is still not perfectly handled. We propose an effective algorithm to solve the Laplacian embedding problem that satisfies the both constraints. To promote the robustness of our embedding model against outliers, we exploit the p-order of the l2-norm distances to find the best solution of the spectral embedding from the input graph. Optimization with both orthonormal and nonnegative constraints is highly nonlinear and nonconvex in feasible domain. The p-order term in our objective further makes it nonsmooth and difficult to efficiently solve in general. We introduce a novel smoothed iterative reweighted method with a smoothness term to tackle this challenging optimization problem and rigorously analyze its convergence. We demonstrate the effectiveness and potential of our proposed method by extensive empirical studies on both synthetic and real data sets.","abstract_html":"Laplacian embedding is a powerful graph based method with its ability in spectral clustering to reveal the intrinsic geometry of data in the high dimensional space. Imposing the orthogonality and the nonnegativity constraints can avoid degenerate and negative solutions, respectively. These two attributes are critical yet challenging to achieve simultaneously. Although, in recent years, many attempts have been made to overcome this, this problem is still not perfectly handled. We propose an effective algorithm to solve the Laplacian embedding problem that satisfies the both constraints. To promote the robustness of our embedding model against outliers, we exploit the p-order of the l2-norm distances to find the best solution of the spectral embedding from the input graph. Optimization with both orthonormal and nonnegative constraints is highly nonlinear and nonconvex in feasible domain. The p-order term in our objective further makes it nonsmooth and difficult to efficiently solve in general. We introduce a novel smoothed iterative reweighted method with a smoothness term to tackle this challenging optimization problem and rigorously analyze its convergence. We demonstrate the effectiveness and potential of our proposed method by extensive empirical studies on both synthetic and real data sets.","abstract_has_math":false,"creators":["Yang, Haoxuan"],"institution":"Colorado School of Mines. Arthur Lakes Library","degree_name":"Master of Science (M.S.)","degree_level":"Masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Wang, Hua"],"committee_chairs":[],"committee_members":["Mehta, Dinesh P.","Yang, Dejun"],"year":2019,"date_issued":"2019","date_published":"2019","updated_at":"2026-07-24T01:42:56Z","subjects":["data embedding","Laplacian embedding","optimization","data mining","clustering","machine learning"],"languages":["eng","English"],"rights":["Copyright of the original work is retained by the author."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["T 8742"],"render_values":[{"text":"T 8742","href":null,"code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/11124/173087","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Wang, Hua"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Mehta, Dinesh P.","Yang, Dejun"]},{"key":"dc:creator","label":"Author","values":["Yang, Haoxuan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-07-08T21:07:36Z","2022-02-03T13:16:32Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-01-03T21:07:39Z","2022-02-03T13:16:32Z"]},{"key":"dc:date.issued","label":"Date","values":["2019"]},{"key":"dc:publisher","label":"Institution","values":["Colorado School of Mines. Arthur Lakes Library"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (M.S.)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Colorado School of Mines"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["data embedding","Laplacian embedding","optimization","data mining","clustering","machine learning"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright of the original work is retained by the author."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["Yang_mines_0052N_11752.pdf","T 8742"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/11124/173087"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Includes bibliographical references.","2019 Summer."]},{"key":"dc:description.abstract","label":"Abstract","values":["Laplacian embedding is a powerful graph based method with its ability in spectral clustering to reveal the intrinsic geometry of data in the high dimensional space. Imposing the orthogonality and the nonnegativity constraints can avoid degenerate and negative solutions, respectively. These two attributes are critical yet challenging to achieve simultaneously. Although, in recent years, many attempts have been made to overcome this, this problem is still not perfectly handled. We propose an effective algorithm to solve the Laplacian embedding problem that satisfies the both constraints. To promote the robustness of our embedding model against outliers, we exploit the p-order of the l2-norm distances to find the best solution of the spectral embedding from the input graph. Optimization with both orthonormal and nonnegative constraints is highly nonlinear and nonconvex in feasible domain. The p-order term in our objective further makes it nonsmooth and difficult to efficiently solve in general. We introduce a novel smoothed iterative reweighted method with a smoothness term to tackle this challenging optimization problem and rigorously analyze its convergence. We demonstrate the effectiveness and potential of our proposed method by extensive empirical studies on both synthetic and real data sets."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["born digital","masters theses"]},{"key":"dc:title","label":"Title","values":["Learning strictly orthogonal p-order nonnegative Laplacian embedding via smoothed iterative reweighted method"]}]}],"canonical_facts":{"dc:contributor.advisor":["Wang, Hua"],"dc:contributor.committeemember":["Mehta, Dinesh P.","Yang, Dejun"],"dc:creator":["Yang, Haoxuan"],"dc:date.accessioned":["2019-07-08T21:07:36Z","2022-02-03T13:16:32Z"],"dc:date.available":["2020-01-03T21:07:39Z","2022-02-03T13:16:32Z"],"dc:date.issued":["2019"],"dc:description":["Includes bibliographical references.","2019 Summer."],"dc:description.abstract":["Laplacian embedding is a powerful graph based method with its ability in spectral clustering to reveal the intrinsic geometry of data in the high dimensional space. Imposing the orthogonality and the nonnegativity constraints can avoid degenerate and negative solutions, respectively. These two attributes are critical yet challenging to achieve simultaneously. Although, in recent years, many attempts have been made to overcome this, this problem is still not perfectly handled. We propose an effective algorithm to solve the Laplacian embedding problem that satisfies the both constraints. To promote the robustness of our embedding model against outliers, we exploit the p-order of the l2-norm distances to find the best solution of the spectral embedding from the input graph. Optimization with both orthonormal and nonnegative constraints is highly nonlinear and nonconvex in feasible domain. The p-order term in our objective further makes it nonsmooth and difficult to efficiently solve in general. We introduce a novel smoothed iterative reweighted method with a smoothness term to tackle this challenging optimization problem and rigorously analyze its convergence. We demonstrate the effectiveness and potential of our proposed method by extensive empirical studies on both synthetic and real data sets."],"dc:format.medium":["born digital","masters theses"],"dc:identifier":["Yang_mines_0052N_11752.pdf","T 8742"],"dc:identifier.uri":["https://hdl.handle.net/11124/173087"],"dc:language":["English"],"dc:language.iso":["eng"],"dc:publisher":["Colorado School of Mines. Arthur Lakes Library"],"dc:rights":["Copyright of the original work is retained by the author."],"dc:subject":["data embedding","Laplacian embedding","optimization","data mining","clustering","machine learning"],"dc:title":["Learning strictly orthogonal p-order nonnegative Laplacian embedding via smoothed iterative reweighted method"],"dc:type":["Text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Masters"],"thesis:degree_name":["Master of Science (M.S.)"],"thesis:institution_name":["Colorado School of Mines"]},"updated_at":"2026-07-24T01:42:56Z"}