Skip to main content
SpringerLink
Log in

Covert Factor’s Exploiting and Factor Planning

  • Published:
Annals of Data Science Aims and scope Submit manuscript

Abstract

All the classification solutions in artificial intelligence can be summed up as explicit factor implicit problem, and the explicit factor implicit problem should be solved by linear programming. The simplex linear programming algorithm is simple and fast, but it is not a polynomial algorithm. Whether it can be improved into a “strong polynomial algorithm”, that is, in any case, the number of operations of this algorithm is a polynomial function of the number of equations and variables, is a trans-century international mathematical problem that has been unsolved for decades. This question, which involves the mathematical boundaries of ai development, is crucial. The method of solving programming problem from the demand and specialty of artificial intelligence is called factor programming. This paper will introduce the basic ideas of factor explicit and implicit programming and factor programming, and write programs for some of the algorithms, and prove the theorem of triangular matrix optimization.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Data availability

All data included in this study are available upon request by contact with the corresponding author.

Code availability

This study was implemented programmatically in Python, and all code included in this article can be obtained by contacting the corresponding author.

References

  1. Shi Y (2022) Advances in big data analytics: theory algorithm and practice. Springer, Singapore

    Book  Google Scholar 

  2. Liu F, Shi Y (2020) Investigating laws of intelligence based on AI IQ research. Ann Data Sci 7:399–416

    Article  Google Scholar 

  3. Wang P, Ouyang H, Zhong Y, He H (2016) Cognition math based on factor space. Ann Data Sci 3:281–303

    Article  Google Scholar 

  4. Olson DL, Shi Y (2007) Introduction to business data mining. McGraw-Hill/Irwin, New York

    Google Scholar 

  5. Shi Y, Tian YJ, Kou G, Peng Y, Li JP (2011) Optimization based data mining: theory and applications. Springer, Berlin

    Book  Google Scholar 

  6. Tien JM (2017) Internet of things, real-time decision making, and artificial intelligence. Ann Data Sci 4(2):149–178

    Article  Google Scholar 

  7. Wang PZ, Liu ZL, Shi Y, Guo SC (2014) Factor space, the theoretical base of data science [J]. Ann Data Science 1(2):233–251

    Article  Google Scholar 

  8. Wang PZ, Zhong YX, He HC, He O (2016) Cognition mathematics and factor space. Ann Data Sci 3(3):281–303

    Article  Google Scholar 

  9. Wang HT, Liu, (2021) Factor Space and Intelligence Artificial Beijing. University of Post & Communications Press, Beijing

    Google Scholar 

  10. Dantzig GB (2002) Linear programming. Oper Res 50(1):42–47

    Article  Google Scholar 

  11. Smale S (1998) Mathematical problems for the next century. Math Intell 20(2):7–15

    Article  Google Scholar 

  12. Wang PZ (2011) Cone-cutting: a variant representation of pivot in Simplex. Inform Technol Decision Making 10(1):65–82

    Article  Google Scholar 

  13. Wang PZ (2014) Discussions on Hirsch conjecture and the existence of strongly polynomial-time simplex variants. Ann Data Sci 1(1):41–71

    Article  Google Scholar 

  14. Wang PZ, Lui HC, Liu HT, Guo SC (2017) Sliding gradient algorithm in linear program. Ann Data Sci 4(2):193–210

    Article  Google Scholar 

  15. Liu H, Wang P (2018) The sliding gradient algorithm for linear programming. Am J Oper Res (AJOR) 8(2):112–131

    Google Scholar 

  16. Wang PZ, He J, Lui HC, Kong QW, Shi Y, Guo SZ. Tri-skill variant simplex and strongly polynomial-time algorithm for linear programming, https://arxiv.org/pdf/2101.02996.pdf

Download references

Author information

Authors and Affiliations

  1. College of Science, Liaoning Technical University, Fuxin, 123000, Liaoning, China

    Hui Sun, Fanhui Zeng & Yang Yang

  2. Institute of Intelligence Engineering and Mathematics, Liaoning Technical University, Fuxin, 123000, China

    Hui Sun, Fanhui Zeng & Yang Yang

Authors
  1. Hui Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fanhui Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Conflict of interests

We declare that we have no conflict of interest.

Author Ccontribution

I testify on behalf of all co-authors that our article submitted to Annals of Data Science.

Corresponding author

Correspondence to Fanhui Zeng.

Ethics declarations

I hereby declare that this manuscrint is the result of my creation with the reviewers’comments. Except for the quoted contents. this manuscript does not contain any research achievements that have been published or written by other individuals or groups. The legal responsibility of this statement shall be borne by me.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, H., Zeng, F. & Yang, Y. Covert Factor’s Exploiting and Factor Planning. Ann. Data. Sci. 9, 449–467 (2022). https://doi.org/10.1007/s40745-022-00394-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40745-022-00394-9

Keywords

Search

Navigation