Heuristic approximation methods for principal points for binary distributions

Haruka Yamashita, Hideo Suzuki

研究成果: Article

3 引用 (Scopus)

抄録

The analysis of binary (0 or 1) data requires an analysis method whose objects are realizations. Yamashita and Suzuki (to appear) proposed principal points for binary distributions based on the concept of principal points, defined by Flury (1990). Ideally, when we search for the binary principal points, all combinations of the k-principal points should be considered; however, this problem cannot be solved in a straightforward manner because the number of combinations increases exponentially when the number of the variables increases. In this paper, we propose three heuristic methods for approximating principal points for binary distributions. The results indicate that our method enables us to find approximated principal points and summarize a binary distribution using the points.

元の言語English
ページ(範囲)131-141
ページ数11
ジャーナルJournal of Japan Industrial Management Association
65
発行部数2
出版物ステータスPublished - 2014
外部発表Yes

Fingerprint

Principal Points
Heuristic methods
Heuristic Method
Approximation Methods
Binary
Heuristics
Approximation

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Applied Mathematics
  • Management Science and Operations Research
  • Strategy and Management

これを引用

Heuristic approximation methods for principal points for binary distributions. / Yamashita, Haruka; Suzuki, Hideo.

:: Journal of Japan Industrial Management Association, 巻 65, 番号 2, 2014, p. 131-141.

研究成果: Article

@article{af7f1293062740e0aaa6b44108e9dac5,
title = "Heuristic approximation methods for principal points for binary distributions",
abstract = "The analysis of binary (0 or 1) data requires an analysis method whose objects are realizations. Yamashita and Suzuki (to appear) proposed principal points for binary distributions based on the concept of principal points, defined by Flury (1990). Ideally, when we search for the binary principal points, all combinations of the k-principal points should be considered; however, this problem cannot be solved in a straightforward manner because the number of combinations increases exponentially when the number of the variables increases. In this paper, we propose three heuristic methods for approximating principal points for binary distributions. The results indicate that our method enables us to find approximated principal points and summarize a binary distribution using the points.",
keywords = "Binary distributions, Data analysis, Heuristic approximation method, K-means algorithm, Principal points",
author = "Haruka Yamashita and Hideo Suzuki",
year = "2014",
language = "English",
volume = "65",
pages = "131--141",
journal = "Journal of Japan Industrial Management Association",
issn = "0386-4812",
publisher = "Nihon Keikei Kogakkai",
number = "2",

}

TY - JOUR

T1 - Heuristic approximation methods for principal points for binary distributions

AU - Yamashita, Haruka

AU - Suzuki, Hideo

PY - 2014

Y1 - 2014

N2 - The analysis of binary (0 or 1) data requires an analysis method whose objects are realizations. Yamashita and Suzuki (to appear) proposed principal points for binary distributions based on the concept of principal points, defined by Flury (1990). Ideally, when we search for the binary principal points, all combinations of the k-principal points should be considered; however, this problem cannot be solved in a straightforward manner because the number of combinations increases exponentially when the number of the variables increases. In this paper, we propose three heuristic methods for approximating principal points for binary distributions. The results indicate that our method enables us to find approximated principal points and summarize a binary distribution using the points.

AB - The analysis of binary (0 or 1) data requires an analysis method whose objects are realizations. Yamashita and Suzuki (to appear) proposed principal points for binary distributions based on the concept of principal points, defined by Flury (1990). Ideally, when we search for the binary principal points, all combinations of the k-principal points should be considered; however, this problem cannot be solved in a straightforward manner because the number of combinations increases exponentially when the number of the variables increases. In this paper, we propose three heuristic methods for approximating principal points for binary distributions. The results indicate that our method enables us to find approximated principal points and summarize a binary distribution using the points.

KW - Binary distributions

KW - Data analysis

KW - Heuristic approximation method

KW - K-means algorithm

KW - Principal points

UR - http://www.scopus.com/inward/record.url?scp=84923228480&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84923228480&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84923228480

VL - 65

SP - 131

EP - 141

JO - Journal of Japan Industrial Management Association

JF - Journal of Japan Industrial Management Association

SN - 0386-4812

IS - 2

ER -