LIONsolver






































LIONsolver
Developer(s) Reactive Search srl
Stable release
2.0.198
/ October 9, 2011; 7 years ago (2011-10-09)

Operating system
Windows , Mac OS X, Unix
Available in English
Type Business intelligence software
License
Proprietary software, free for academic use
Website lionoso.com

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


LIONsolver can be used to build models, visualize them, and improve business and engineering processes.
It is a tool for decision making based on data and quantitative models, it can be connected to most databases
and external programs, it is fully integrated with the Grapheur business intelligence software and intended for more advanced users, interested in designing business logic and processes and not only in simple analytics and visualization tasks.




Contents






  • 1 Overview


  • 2 See also


  • 3 References


  • 4 External links





Overview


LIONsolver originates from research principles in Reactive Search Optimization[3] 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,[4]
which provides a direct way of defining design spaces involving Reactive Search Optimization, and
of Autonomous Search
[5] 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[6]
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.[7]


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



See also


  • Multi-objective optimization


References





  1. ^ Battiti, Roberto; Mauro Brunato (2014). The LION way. Machine Learning plus Intelligent Optimization. Trento, Italy: LIONlab, University of Trento. ISBN 978-14-960340-2-1..mw-parser-output cite.citation{font-style:inherit}.mw-parser-output q{quotes:"""""""'""'"}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}


  2. ^ Battiti, Roberto; Mauro Brunato; Franco Mascia (2008). Reactive Search and Intelligent Optimization. Springer Verlag. ISBN 978-0-387-09623-0.


  3. ^ 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.


  4. ^ Holger, Hoos (2012). "Programming by optimization" (PDF). Communications of the ACM. 55 (2): 70–80. doi:10.1145/2076450.2076469.


  5. ^ Youssef, Hamadi; E. Monfroy; F. Saubion (2012). Autonomous Search. New York: Springer Verlag. ISBN 978-3-642-21433-2.


  6. ^ Battiti, Roberto; Mauro Brunato (2010). "Grapheur: A Software Architecture for Reactive and Interactive Optimization" [Proceedings Learning and Intelligent OptimizatioN LION 4, Jan 18-22, 2010, Venice, Italy.] (PDF). Lecture Notes in Computer Science. 6073: 232–246. doi:10.1007/978-3-642-13800-3.


  7. ^
    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.


  8. ^ ""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.




External links


  • LIONsolver official non-profit site



Popular posts from this blog

Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

Image
28 6 $begingroup$ Per the Font of Magic feature, sorcerer can use Flexible Casting to create 5th-level spell slots at level 7, even though they are not typically available until level 9. You can transform unexpended sorcery points into one spell slot as a bonus action on your turn. The Creating Spell Slots table shows the cost of creating a spell slot of [5th level is 7] If such a sorcerer levels up while still having this 5th-level spell slot, can they choose a 5th-level spell as the spell they gain upon levelling up? The Spellcasting feature states: Additionally, when you gain a level in this class, you can choose one of the sorcerer spells you know and replace it with another spell from the sorcerer spell list, which also must be of a level for which you have spell slots.
Read more

Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

Image
up vote 13 down vote favorite 1 After the 2018 errata, the disintegrate spell description now reads: A creature targeted by this spell must make a Dexterity saving throw. On a failed save, the target takes 10d6 + 40 force damage. The target is disintegrated if this damage leaves it with 0 hit points. If you were to polymorph an enemy into a rat and then disintegrate it, would the enemy be disintegrated or would it just return to its original form? I know that for Druids, it’s not an instant kill anymore, but is this the case for polymorph as well? dnd-5e spells polymorph errata share | improve this question edited 18 hours ago
Read more

A Topological Invariant for $pi_3(U(n))$

Image
3 3 $begingroup$ Recently, I saw a construction of topological invariant for $pi_3(U(n))$ with $ngeq 2$ : $$ N=frac{1}{24pi^2}int_{S^3} d^3x epsilon^{ijk} Tr[(U^{-1}partial_{x_i}U)(U^{-1}partial_{x_j}U)(U^{-1}partial_{x_k}U)] , $$ where $Uin U(n)$ depends on $boldsymbol{x}=(x_1,x_2,x_3)in S^3$ , $epsilon^{ijk}$ is the Levi-Civita symbol, $i,j,k=1,2,3$ , and the duplicated indexes are summed over. It is claimed that $N$ is an integer, but why? Update 02/02/2019 I think I got an argument for $n=2$ . In this case, $U=e^{i varphi} q$ with $qin SU(2)$ . Due to the trace and the Levi-Civita symbol in $N$ , $varphi$ does not contribute to $N$ . As $Tr[q^{dagger}partial_i q]=0$ and $(q^{dagger}partial_i q)^{dagger}=-q^{dagger}partial_i q$ , $q^{dagger}partial_i q$ in geneeral has the form $q^{dagger}partia
Read more