{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/82135"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/82135","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"The Structural Representation of Three -Way Proximity Data","abstract":"Scaling and clustering techniques are well-established statistical methods for generating continuous and discrete structural representations of the relationships between the row and column objects of proximity matrices. Most commonly, the representational structure is fit to the observed data through minimizing the least-squares loss function; traditional implementations rely typically on gradient or sub-gradient optimization. Alternatively, scaling and clustering can be reformulated as combinatorial data analytic tasks, solvable through discrete optimization strategies. We develop generalizations of combinatorial algorithms for analyzing individual differences through scaling and clustering three-way data that consist of collections of proximity matrices observed on multiple sources. We propose an approach derived from a deviation-from-the-mean principle. Order-constrained matrix decomposition can be regarded as a combinatorial data analytic meta-technique, providing a unifying framework for evaluating the differential merits of continuous and discrete structural representations of proximity matrices. We introduce a generalization of order-constrained matrix decomposition to accommodate three-way proximity data. Multiobjective programming, as an alternative approach to modelling three-way data, is presented, accompanied by a survey of existing applications in the psychometric literature.","abstract_html":"Scaling and clustering techniques are well-established statistical methods for generating continuous and discrete structural representations of the relationships between the row and column objects of proximity matrices. Most commonly, the representational structure is fit to the observed data through minimizing the least-squares loss function; traditional implementations rely typically on gradient or sub-gradient optimization. Alternatively, scaling and clustering can be reformulated as combinatorial data analytic tasks, solvable through discrete optimization strategies. We develop generalizations of combinatorial algorithms for analyzing individual differences through scaling and clustering three-way data that consist of collections of proximity matrices observed on multiple sources. We propose an approach derived from a deviation-from-the-mean principle. Order-constrained matrix decomposition can be regarded as a combinatorial data analytic meta-technique, providing a unifying framework for evaluating the differential merits of continuous and discrete structural representations of proximity matrices. We introduce a generalization of order-constrained matrix decomposition to accommodate three-way proximity data. Multiobjective programming, as an alternative approach to modelling three-way data, is presented, accompanied by a survey of existing applications in the psychometric literature.","abstract_has_math":false,"creators":["Koehn, Hans F."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Psychology","degree_department":null,"school":null,"contributors":["Hubert, Lawrence J."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:39:18Z","date_published":"2015-09-25T20:39:18Z","updated_at":"2026-07-22T22:26:17Z","subjects":["Psychology, Psychometrics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3290276"],"render_values":[{"text":"(MiAaPQ)AAI3290276","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/82135","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hubert, Lawrence J."]},{"key":"dc:creator","label":"Author","values":["Koehn, Hans F."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:39:18Z","10000-01-01","2007"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Psychology"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Psychology, Psychometrics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/82135","(MiAaPQ)AAI3290276"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Scaling and clustering techniques are well-established statistical methods for generating continuous and discrete structural representations of the relationships between the row and column objects of proximity matrices. Most commonly, the representational structure is fit to the observed data through minimizing the least-squares loss function; traditional implementations rely typically on gradient or sub-gradient optimization. Alternatively, scaling and clustering can be reformulated as combinatorial data analytic tasks, solvable through discrete optimization strategies. We develop generalizations of combinatorial algorithms for analyzing individual differences through scaling and clustering three-way data that consist of collections of proximity matrices observed on multiple sources. We propose an approach derived from a deviation-from-the-mean principle. Order-constrained matrix decomposition can be regarded as a combinatorial data analytic meta-technique, providing a unifying framework for evaluating the differential merits of continuous and discrete structural representations of proximity matrices. We introduce a generalization of order-constrained matrix decomposition to accommodate three-way proximity data. Multiobjective programming, as an alternative approach to modelling three-way data, is presented, accompanied by a survey of existing applications in the psychometric literature.","Made available in DSpace on 2015-09-25T20:39:18Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3290276.pdf: 5070288 bytes, checksum: 779c3c3d12ea65a7a01d604317ac9e0e (MD5) Previous issue date: 2007","Embargo set by: Seth Robbins for item 83416 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","175 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007."]},{"key":"dc:title","label":"Title","values":["The Structural Representation of Three -Way Proximity Data"]}]}],"canonical_facts":{"dc:contributor":["Hubert, Lawrence J."],"dc:creator":["Koehn, Hans F."],"dc:date":["2015-09-25T20:39:18Z","10000-01-01","2007"],"dc:description":["Scaling and clustering techniques are well-established statistical methods for generating continuous and discrete structural representations of the relationships between the row and column objects of proximity matrices. Most commonly, the representational structure is fit to the observed data through minimizing the least-squares loss function; traditional implementations rely typically on gradient or sub-gradient optimization. Alternatively, scaling and clustering can be reformulated as combinatorial data analytic tasks, solvable through discrete optimization strategies. We develop generalizations of combinatorial algorithms for analyzing individual differences through scaling and clustering three-way data that consist of collections of proximity matrices observed on multiple sources. We propose an approach derived from a deviation-from-the-mean principle. Order-constrained matrix decomposition can be regarded as a combinatorial data analytic meta-technique, providing a unifying framework for evaluating the differential merits of continuous and discrete structural representations of proximity matrices. We introduce a generalization of order-constrained matrix decomposition to accommodate three-way proximity data. Multiobjective programming, as an alternative approach to modelling three-way data, is presented, accompanied by a survey of existing applications in the psychometric literature.","Made available in DSpace on 2015-09-25T20:39:18Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3290276.pdf: 5070288 bytes, checksum: 779c3c3d12ea65a7a01d604317ac9e0e (MD5) Previous issue date: 2007","Embargo set by: Seth Robbins for item 83416 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","175 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007."],"dc:identifier":["http://hdl.handle.net/2142/82135","(MiAaPQ)AAI3290276"],"dc:language":["eng"],"dc:subject":["Psychology, Psychometrics"],"dc:title":["The Structural Representation of Three -Way Proximity Data"],"dc:type":["text"],"thesis:degree_discipline":["Psychology"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:17Z"}