Skip to search formSkip to main contentSkip to account menu

Combinatorial data analysis

Combinatorial data analysis (CDA) is the study of data sets where the arrangement of objects is important. CDA can be used either to determine how… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Seriation is a combinatorial optimisation problem that aims to sequence a set of objects such that a natural ordering is created… 
2014
2014
Multiple discrete (non-spatial) and continuous (spatial) structures can be fitted to a proximity matrix to increase the… 
2014
2014
Several real life problem in areas like parallel computing, distributed computing, facilities location, and combinatorial data… 
2011
2011
We propose a hybrid heuristic procedure based on scatter search and tabu search for the problem of clustering objects to optimize… 
2008
2008
We applya semi-supervised technique called Supervised Principal Component (SPC) to explore the relationship between the… 
2006
2006
We develop a metaheuristic procedure for multiobjective clustering problems. Our goal is to find good approximations of the… 
2000
2000
The general problem discussed here concerns the approximation of the number of solutions of a boolean formula in conjunctive… 
1988
1988
Simulated annealing was compared with a (locally optimal) pairwise interchange algorithm on two combinatorial data analysis tasks… 
1988
1988
1 Introduction.- Characterization of Research Papers by Data Analysis Techniques.- The Interface Among Data Analysis, Marketing…