Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0641.68031
Guenoche, A.; Monjardet, B.
Methodes ordinales et combinatoires en analyse des donnees. (Ordinal and combinatorial methods in data analysis). (French)
[J] Math. Sci. Hum. 100, 5-47 (1987). ISSN 0987-6936

Summary: In this paper first we formulate some remarks on relations between discrete mathematics, computer sciences and data analysis. Then we present a set of methods using ordinal or combinatorial techniques. Boolean analysis and graph theory approach for binary data, tree representations (additive trees, n-trees), seriation methods for symmetric or not symmetric dissimilarity arrays, preferences aggregation procedures and consensus problems are studied. For each method we give a brief description and some bibliographic references concerning theoretical apsects and description of algorithms. Methods are classified according to the structures of the data processes: one or several arrays of type ${\bbfI}\times {\bbfJ}$ or ${\bbfK}\times {\bbfK}$, with binary, ordinal or quantitative values.

MSC 2000:: *68P05 Data structures
62-07 Data analysis (statistics)
05C05 Trees

Keywords: discrete mathematics; survey; bibliography; data analysis; binary data; tree representations; seriation methods; dissimilarity arrays; preferences aggregation procedures; consensus problems

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]