1997
DOI: 10.1007/978-3-642-59051-1_58
|View full text |Cite
|
Sign up to set email alerts
|

Two-Mode Overlapping Clustering With Applications to Simultaneous Benefit Segmentation and Market Structuring

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0
4

Year Published

2005
2005
2013
2013

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 45 publications
(31 citation statements)
references
References 14 publications
0
27
0
4
Order By: Relevance
“…The new algorithm, which incorporates general recommendations regarding optimally designing ALS algorithms, calculates conditionally optimal estimates for the membership matrices and the core matrix of the model in their entirety. In an extensive simulation study, the new algorithm has been shown to outperform two previously proposed algorithms for the same model: P ENCLUS (Both and Gaul 1985) and Clusterwise ALS (Baier et al 1997). As a consequence, the use of the F ull clustering ALS algorithm can be recommended in statistical practice 5 .…”
Section: Resultsmentioning
confidence: 87%
See 1 more Smart Citation
“…The new algorithm, which incorporates general recommendations regarding optimally designing ALS algorithms, calculates conditionally optimal estimates for the membership matrices and the core matrix of the model in their entirety. In an extensive simulation study, the new algorithm has been shown to outperform two previously proposed algorithms for the same model: P ENCLUS (Both and Gaul 1985) and Clusterwise ALS (Baier et al 1997). As a consequence, the use of the F ull clustering ALS algorithm can be recommended in statistical practice 5 .…”
Section: Resultsmentioning
confidence: 87%
“…To fit the additive biclustering model in a least squares sense to a data matrix at hand, two alternating least squares (ALS) approaches have been proposed: (1) P ENCLUS Gaul 1987, 1985;Schader and Gaul 1996), and (2) the ALS approach of Baier, Gaul, and Schader (1997), which further will be denoted as Clusterwise ALS. 3 In ALS algorithms, which be-3.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we present a clustering model 1 where the problem of clustering is formulated as matrix approximations. The model explicitly characterizes the data and feature memberships and thus enables the descriptions of each cluster.…”
Section: Clusteringmentioning
confidence: 99%
“…The notations used in the paper are introduced in Table 1. 1 In this paper, we use model and framework interchangeably.…”
Section: The Clustering Modelmentioning
confidence: 99%
See 1 more Smart Citation