Jump to content

LIONsolver

From Wikipedia, the free encyclopedia
(Redirected from Reactive search)
LIONsolver
Developer(s)Reactive Search srl
Stable release
2.0.198 / October 9, 2011; 13 years ago (2011-10-09)
Operating systemWindows, Mac OS X, Unix
Available inEnglish
TypeBusiness intelligence software
LicenseProprietary software, free for academic use
Websitelionoso.com

LIONsolver is an integrated software for data mining, business intelligence, analytics, and modeling and reactive business intelligence approach.[1] A non-profit version is also available as LIONoso.

LIONsolver is used to build models, visualize them, and improve business and engineering processes.

It is a tool for decision making based on data and quantitative model and it can be connected to most databases and external programs.

The software is fully integrated with the Grapheur business intelligence and intended for more advanced users.

Overview

[edit]

LIONsolver originates from research principles in Reactive Search Optimization[2] advocating the use of self-tuning schemes acting while a software system is running. Learning and Intelligent OptimizatioN refers to the integration of online machine learning schemes into the optimization software, so that it becomes capable of learning from its previous runs and from human feedback. A related approach is that of Programming by Optimization,[3] which provides a direct way of defining design spaces involving Reactive Search Optimization, and of Autonomous Search [4] advocating adapting problem-solving algorithms.

Version 2.0 of the software was released on Oct 1, 2011, covering also the Unix and Mac OS X operating systems in addition to Windows.

The modeling components include neural networks, polynomials, locally weighted Bayesian regression, k-means clustering, and self-organizing maps. A free academic license for non-commercial use and class use is available.

The software architecture of LIONsolver[5] permits interactive multi-objective optimization, with a user interface for visualizing the results and facilitating the solution analysis and decision-making process. The architecture allows for problem-specific extensions, and it is applicable as a post-processing tool for all optimization schemes with a number of different potential solutions. When the architecture is tightly coupled to a specific problem-solving or optimization method, effective interactive schemes where the final decision maker is in the loop can be developed.[6]

On Apr 24, 2013 LIONsolver received the first prize of the Michael J. Fox FoundationKaggle Parkinson's Data Challenge, a contest leveraging "the wisdom of the crowd" to benefit people with Parkinson's disease.[7]

See also

[edit]

References

[edit]
  1. ^ Battiti, Roberto; Mauro Brunato; Franco Mascia (2008). Reactive Search and Intelligent Optimization. Springer Verlag. ISBN 978-0-387-09623-0.
  2. ^ Battiti, Roberto; Gianpietro Tecchiolli (1994). "The reactive tabu search" (PDF). ORSA Journal on Computing. 6 (2): 126–140. doi:10.1287/ijoc.6.2.126.
  3. ^ Holger, Hoos (2012). "Programming by optimization". Communications of the ACM. 55 (2): 70–80. doi:10.1145/2076450.2076469.
  4. ^ Youssef, Hamadi; E. Monfroy; F. Saubion (2012). Autonomous Search. New York: Springer Verlag. ISBN 978-3-642-21433-2.
  5. ^ Battiti, Roberto; Mauro Brunato (2010). Learning and Intelligent Optimization [Proceedings Learning and Intelligent OptimizatioN LION 4, Jan 18-22, 2010, Venice, Italy.] (PDF). Lecture Notes in Computer Science. Vol. 6073. pp. 232–246. doi:10.1007/978-3-642-13800-3. ISBN 978-3-642-13799-0.
  6. ^ Battiti, Roberto; Andrea Passerini (2010). "Brain-Computer Evolutionary Multi-Objective Optimization (BC-EMO): a genetic algorithm adapting to the decision maker" (PDF). IEEE Transactions on Evolutionary Computation. 14 (15): 671–687. doi:10.1109/TEVC.2010.2058118.
  7. ^ ""Machine Learning Approach" to Smartphone Data Garners $10,000 First Prize in The Michael J. Fox Foundation Parkinson's Data Challenge". MJFF. April 24, 2013.
[edit]