Robust Multidimensional Scaling

Leanna L. House () and David Banks ()
Additional contact information
Leanna L. House: Duke University, Institute of Statistics and Decision Sciences
David Banks: Duke University, Institute of Statistics and Decision Sciences

A chapter in COMPSTAT 2004 — Proceedings in Computational Statistics, 2004, pp 251-259 from Springer

Abstract: Abstract Modern technology enables the collection of vast quantities of data. Smart automatic data selection algorithms are needed to discover important data structures that are obscured by other structure or random noise. We suggest an efficient and flexible algorithm that chooses the “best ” subsample from a given dataset. We avoid the combinatorial search over all possible subsamples and efficiently find the datapoints that describe the primary structure of the data. Although the algorithm can be used in many analysis scenarios, this paper explores the application of the method to problems in multidimensional scaling.

Keywords: Statistical computing; data reduction; robust; multidimensional scaling (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7908-2656-2_20

Ordering information: This item can be ordered from
http://www.springer.com/9783790826562

DOI: 10.1007/978-3-7908-2656-2_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().