IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n729763.html

Nonlinear Fault Separation for Redundancy Process Variables Based on FNN in MKFDA Subspace

Author

Listed:
  • Ying-ying Su
  • Shan Liang
  • Jing-zhe Li
  • Xiao-gang Deng
  • Tai-fu Li
  • Cheng Zeng

Abstract

Nonlinear faults are difficultly separated for amounts of redundancy process variables in process industry. This paper introduces an improved kernel fisher distinguish analysis method (KFDA). All the original process variables with faults are firstly optimally classified in multi‐KFDA (MKFDA) subspace to obtain fisher criterion values. Multikernel is used to consider different distributions for variables. Then each variable is eliminated once from original sets, and new projection is computed with the same MKFDA direction. From this, differences between new Fisher criterion values and the original ones are tested. If it changed obviously, the effect of eliminated variable should be much important on faults called false nearest neighbors (FNN). The same test is applied to the remaining variables in turn. Two nonlinear faults crossed in Tennessee Eastman process are separated with lower observation variables for further study. Results show that the method in the paper can eliminate redundant and irrelevant nonlinear process variables as well as enhancing the accuracy of classification.

Suggested Citation

  • Ying-ying Su & Shan Liang & Jing-zhe Li & Xiao-gang Deng & Tai-fu Li & Cheng Zeng, 2014. "Nonlinear Fault Separation for Redundancy Process Variables Based on FNN in MKFDA Subspace," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:729763
    DOI: 10.1155/2014/729763
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/729763
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/729763?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. JOURNEE, Michel & NESTEROV, Yurii & RICHTARIK, Peter & SEPULCHRE, Rodolphe, 2010. "Generalized power method for sparse principal component analysis," LIDAM Reprints CORE 2232, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yixuan Qiu & Jing Lei & Kathryn Roeder, 2023. "Gradient-based sparse principal component analysis with extensions to online learning," Biometrika, Biometrika Trust, vol. 110(2), pages 339-360.
    2. Jin-Xing Liu & Yong Xu & Chun-Hou Zheng & Yi Wang & Jing-Yu Yang, 2012. "Characteristic Gene Selection via Weighting Principal Components by Singular Values," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-10, July.
    3. Merola, Giovanni Maria & Chen, Gemai, 2019. "Projection sparse principal component analysis: An efficient least squares method," Journal of Multivariate Analysis, Elsevier, vol. 173(C), pages 366-382.
    4. Chris Khulu & Shaun Ramroop, 2020. "Key Determinants of Anemia among Youngsters under Five Years in Senegal, Malawi, and Angola," IJERPH, MDPI, vol. 17(22), pages 1-12, November.
    5. Amir Beck & Yakov Vaisbourd, 2016. "The Sparse Principal Component Analysis Problem: Optimality Conditions and Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 119-143, July.
    6. Nerea González-García & Ana Belén Nieto-Librero & Purificación Galindo-Villardón, 2023. "CenetBiplot: a new proposal of sparse and orthogonal biplots methods by means of elastic net CSVD," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 17(1), pages 5-19, March.
    7. Yiping Lu & Jiajin Li & Lexing Ying & Jose Blanchet, 2022. "Synthetic Principal Component Design: Fast Covariate Balancing with Synthetic Controls," Papers 2211.15241, arXiv.org.
    8. Rosember Guerra-Urzola & Katrijn Van Deun & Juan C. Vera & Klaas Sijtsma, 2021. "A Guide for Sparse PCA: Model Comparison and Applications," Psychometrika, Springer;The Psychometric Society, vol. 86(4), pages 893-919, December.
    9. Michael Greenacre & Patrick J. F Groenen & Trevor Hastie & Alfonso Iodice d’Enza & Angelos Markos & Elena Tuzhilina, 2023. "Principal component analysis," Economics Working Papers 1856, Department of Economics and Business, Universitat Pompeu Fabra.
    10. Liu, Yong-Jin & Wan, Yuqi & Lin, Lanyu, 2024. "An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem," Applied Mathematics and Computation, Elsevier, vol. 475(C).
    11. Santanu S. Dey & Rahul Mazumder & Guanyi Wang, 2022. "Using ℓ 1 -Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA," Operations Research, INFORMS, vol. 70(3), pages 1914-1932, May.
    12. Yongchun Li & Weijun Xie, 2025. "Exact and Approximation Algorithms for Sparse Principal Component Analysis," INFORMS Journal on Computing, INFORMS, vol. 37(3), pages 582-602, May.
    13. Guerra Urzola, Rosember & Van Deun, Katrijn & Vera, J. C. & Sijtsma, K., 2021. "A guide for sparse PCA : Model comparison and applications," Other publications TiSEM 4d35b931-7f49-444b-b92f-a, Tilburg University, School of Economics and Management.
    14. Viet Anh Nguyen & Soroosh Shafieezadeh-Abadeh & Daniel Kuhn & Peyman Mohajerin Esfahani, 2023. "Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimization," Mathematics of Operations Research, INFORMS, vol. 48(1), pages 1-37, February.
    15. Yuqia Wu & Shaohua Pan & Shujun Bi, 2021. "Kurdyka–Łojasiewicz Property of Zero-Norm Composite Functions," Journal of Optimization Theory and Applications, Springer, vol. 188(1), pages 94-112, January.
    16. repec:plo:pone00:0133124 is not listed on IDEAS
    17. Yu, Ju-Chi & Le Borgne, Julie & Krishnan, Anjali & Gloaguen, Arnaud & Yang, Cheng-Ta & Rabin, Laura A. & Abdi, Hervé & Guillemot, Vincent, 2025. "Sparse factor analysis for categorical data with the group-sparse generalized singular value decomposition," Computational Statistics & Data Analysis, Elsevier, vol. 209(C).
    18. David H. Gutman & Nam Ho-Nguyen, 2023. "Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds," Mathematics of Operations Research, INFORMS, vol. 48(1), pages 127-159, March.
    19. Lars Eldén & Nickolay Trendafilov, 2019. "Semi-sparse PCA," Psychometrika, Springer;The Psychometric Society, vol. 84(1), pages 164-185, March.
    20. Othman El Balghiti & Adam N. Elmachtoub & Paul Grigas & Ambuj Tewari, 2023. "Generalization Bounds in the Predict-Then-Optimize Framework," Mathematics of Operations Research, INFORMS, vol. 48(4), pages 2043-2065, November.
    21. Jiaxiang Li & Shiqian Ma & Tejes Srivastava, 2025. "A Riemannian Alternating Direction Method of Multipliers," Mathematics of Operations Research, INFORMS, vol. 50(4), pages 3222-3242, November.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnljam:v:2014:y:2014:i:1:n:729763. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.