Author
Listed:
- Nurretin Dorukhan Sergin
(School of Computing and Augmented Intelligence, Arizona State University, Tempe, Arizona 85281)
- Jiuyun Hu
(School of Computing and Augmented Intelligence, Arizona State University, Tempe, Arizona 85281)
- Ziyue Li
(Cologne Institute for Information Systems, University of Cologne, 50923 Cologne, Germany; and EWI gGmbH, University of Cologne, 50923 Cologne, Germany)
- Chen Zhang
(Department of Industrial Engineering, Tsinghua University, Beijing 100190, China)
- Fugee Tsung
(Department of Industrial Engineering and Decision Analytics, Hong Kong University of Science and Technology, Hong Kong; and Information Hub, Hong Kong University of Science and Technology (Guangzhou), Guangzhou 511457, China)
- Hao Yan
(School of Computing and Augmented Intelligence, Arizona State University, Tempe, Arizona 85281)
Abstract
Tensor clustering has become an important topic, specifically in spatiotemporal modeling, because of its ability to cluster spatial modes (e.g., stations or road segments) and temporal modes (e.g., time of day or day of the week). Our motivating example is from subway passenger flow modeling, where similarities between stations are commonly found. However, the challenges lie in the innate high-dimensionality of tensors and also the potential existence of anomalies. This is because the three tasks, that is, dimension reduction, clustering, and anomaly decomposition, are intercorrelated with each other, and treating them in a separate manner will render a suboptimal performance. Thus, in this work, we design a tensor-based subspace clustering and anomaly decomposition technique for simultaneous outlier-robust dimension reduction and clustering for high-dimensional tensors. To achieve this, a novel low-rank robust subspace clustering decomposition model is proposed by combining Tucker decomposition, sparse anomaly decomposition, and subspace clustering. An effective algorithm based on Block Coordinate Descent is proposed to update the parameters. Prudent experiments prove the effectiveness of the proposed framework via the simulation study, with a gain of +25% clustering accuracy over benchmark methods in a hard case. The interrelations of the three tasks are also analyzed via ablation studies, validating the interrelation assumption. Moreover, a case study in station clustering based on real passenger flow data is conducted, with quite valuable insights discovered.
Suggested Citation
Nurretin Dorukhan Sergin & Jiuyun Hu & Ziyue Li & Chen Zhang & Fugee Tsung & Hao Yan, 2025.
"Low-Rank Robust Subspace Tensor Clustering for Metro Passenger Flow Modeling,"
INFORMS Joural on Data Science, INFORMS, vol. 4(1), pages 33-50, January.
Handle:
RePEc:inm:orijds:v:4:y:2025:i:1:p:33-50
DOI: 10.1287/ijds.2022.0028
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijds:v:4:y:2025:i:1:p:33-50. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.