東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

The structural representation of thr...

Koehn, Hans F.

FindBook

Google Book

Amazon

博客來

The structural representation of three -way proximity data.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	The structural representation of three -way proximity data./
作者:	Koehn, Hans F.
面頁冊數:	175 p.
附註:	Source: Dissertation Abstracts International, Volume: 68-11, Section: B, page: 7704.
Contained By:	Dissertation Abstracts International68-11B.
標題:	Quantitative psychology. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3290276
ISBN:	9780549342441

The structural representation of three -way proximity data.
Koehn, Hans F.

The structural representation of three -way proximity data. - 175 p.

Source: Dissertation Abstracts International, Volume: 68-11, Section: B, page: 7704.

Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.

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.

ISBN: 9780549342441Subjects--Topical Terms:

2144748
Quantitative psychology.

The structural representation of three -way proximity data.
LDR:02274nmm a2200265 4500 001 2055090
005 20151231075023.5
008 170521s2007 ||||||||||||||||| ||eng d
020 $a 9780549342441
035 $a (MiAaPQ)AAI3290276
035 $a AAI3290276
040 $a MiAaPQ $c MiAaPQ
100 1 $a Koehn, Hans F. $3 3168705
245 1 4 $a The structural representation of three -way proximity data.
300 $a 175 p.
500 $a Source: Dissertation Abstracts International, Volume: 68-11, Section: B, page: 7704.
500 $a Adviser: Lawrence J. Hubert.
502 $a Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.
520 $a 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.
590 $a School code: 0090.
650 4 $a Quantitative psychology. $3 2144748
690 $a 0632
710 2 $a University of Illinois at Urbana-Champaign. $3 626646
773 0 $t Dissertation Abstracts International $g 68-11B.
790 $a 0090
791 $a Ph.D.
792 $a 2007
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3290276