Business Dynamics in KPI Space. Some thoughts on how business analytics can benefit from using principles of classical physics

Authors: Alex Ushveridze

arXiv: 1702.01742v1 - DOI (q-fin.GN)
24 pages

Abstract: The biggest problem with the methods of machine learning used today in business analytics is that they do not generalize well and often fail when applied to new data. One of the possible approaches to this problem is to enrich these methods (which are almost exclusively based on statistical algorithms) with some intrinsically deterministic add-ons borrowed from theoretical physics. The idea proposed in this note is to divide the set of Key Performance Indicators (KPIs) characterizing an individual business into the following two distinct groups: 1) highly volatile KPIs mostly determined by external factors and thus poorly controllable by a business, and 2) relatively stable KPIs identified and controlled by a business itself. It looks like, whereas the dynamics of the first group can, as before, be studied using statistical methods, for studying and optimizing the dynamics of the second group it is better to use deterministic principles similar to the Principle of Least Action of classical mechanics. Such approach opens a whole bunch of new interesting opportunities in business analytics, with numerous practical applications including diverse aspects of operational and strategic planning, change management, ROI optimization, etc. Uncovering and utilizing dynamical laws of the controllable KPIs would also allow one to use dynamical invariants of business as the most natural sets of risk and performance indicators, and facilitate business growth by using effects of parametric resonance with natural business cycles.

Submitted to arXiv on 05 Feb. 2017

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.