The problem of finding large complete subgraphs in bipartite graphs (that is, bicliques) is a well-known combinatorial optimization problem referred to as the maximum-edge biclique problem (MBP), and has many applications, e.g., in web community discovery, biological data analysis and text...

We propose a robust method for estimating principal functions based on MM estimation. Specifically, we formulate functional principal component analysis into alternating penalized M-regression with a bounded loss function. The resulting principal functions are given as M-type smoothing spline...