Name
Abstract | ||
|---|---|---|
.The "Logical Analysis of Data" (LAD) is a methodology developed sincethe late eightees, aimed at discovering hidden structural information in data sets.LAD was originally developed for analyzing binary data by using the theory ofpartially defined Boolean functions. An extension of LAD for the analysis of numericaldata sets is achived through the process of "binarization" consisting in thereplacement of each numerical variable by binary "indicator" variables, each showingwhether the value ... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BF02614316 | Math. Program. |
Keywords | Field | DocType |
numerical data,machine learning,data analysis: boolean functions,thresholdness,binarization,logical analysis,computational complexity,monotonicity,set coveting,data analysis,boolean function | Boolean function,Monotonic function,Discrete mathematics,Mathematical optimization,Algorithm,Combinatorial optimization,Integer programming,Binary data,Time complexity,Mathematics,Computational complexity theory,Binary number | Journal |
Volume | Issue | ISSN |
79 | 1-3 | 0025-5610 |
Citations | PageRank | References |
102 | 6.70 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Endre Boros | 1 | 1779 | 155.63 |
| Peter L. Hammer | 2 | 1996 | 288.93 |
| Toshihide Ibaraki | 3 | 2593 | 385.64 |
| Alexander Kogan | 4 | 102 | 6.70 |