内容简介
Combinatorialdataanalysis(CDA)referstoawideclassofmethodsforthestudyofrelevantdatasetsinwhichthearrangementofacollectionofobjectsisabsolutelycentral.CombinatorialDataAnalysis:OptimizationbyDynamicProgrammingfocusesontheidentificationofarrangements,whicharethenfurtherrestrictedtowherethecombinatorialsearchiscarriedoutbyarecursiveoptimizationprocessbasedonthegeneralprinciplesofdynamicprogramming(DP).Theauthorsprovideacomprehensiveandself-containedreviewdelineatingaverygeneralDPparadigm,orschema,thatcanservetwofunctions.First,theparadigmcanbeappliedinvariousspecialformstoencompassallpreviouslyproposedapplicationssuggestedintheclassificationliterature.Second,theparadigmcanleaddirectlytomanymorenoveluses.Anappendixisincludedasauser'smanualforacollectionofprogramsavailableasfreeware.TheincorporationofawidevarietyofCDAtasksunderonecommonoptimizationframeworkbasedonDPisoneofthisbook'sstrongestpoints.Theauthorsincludeverifiablyoptimalsolutionstonontriviallysizedproblemsoverthearrayofdataanalysistasksdiscussed.Thismonographprovidesanapplieddocumentationsource,aswellasanintroductiontoacollectionofassociatedcomputerprograms,thatwillbeofinteresttoappliedstatisticiansanddataanalystsaswellasnotationallysophisticatedusers.