Difference between revisions of "Ashwin Srinivasan"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Ashwin Srinivasan''' FILE:ashwin.srinivasan.JPG|border|right|thumb|link=http://www.cse.iitd.ernet.in/~ashwin/| Ashwin Srinivasan <ref>[...")
 
Line 4: Line 4:
  
 
'''Ashwin Srinivasan''',<br/>
 
'''Ashwin Srinivasan''',<br/>
an Indian born, Australian-British electrical engineer, computer scientist and research staff member at [[IBM]] India Research Lab <ref>[http://www.cse.iitd.ernet.in/~ashwin/work/resume.html Ashwin Srinivasan - Curriculum Vitae]</ref> <ref>[http://www-07.ibm.com/in/research/ IBM Research – India]</ref>, [https://en.wikipedia.org/wiki/New_Delhi New Delhi].  
+
an Indian born, Australian-British electrical engineer, computer scientist, and senior professor of computer science at [https://en.wikipedia.org/wiki/Birla_Institute_of_Technology_and_Science,_Pilani BITS-Pilani], [https://en.wikipedia.org/wiki/Birla_Institute_of_Technology_and_Science,_Pilani_%E2%80%93_Goa_Campus Goa Campus] <ref>[https://scholar.google.com.au/citations?user=zpNTeogAAAAJ&hl=en Ashwin Srinivasan - Google Scholar Citations]</ref>, and previously research staff member at [[IBM]] India Research Lab <ref>[http://www.cse.iitd.ernet.in/~ashwin/work/resume.html Ashwin Srinivasan - Curriculum Vitae]</ref> <ref>[http://www-07.ibm.com/in/research/ IBM Research – India]</ref>, [https://en.wikipedia.org/wiki/New_Delhi New Delhi].  
 
He holds a Ph.D. from [https://en.wikipedia.org/wiki/University_of_New_South_Wales University of New South Wales] on [https://en.wikipedia.org/wiki/Non-monotonic_logic Non-monotonic logics] and their application.  
 
He holds a Ph.D. from [https://en.wikipedia.org/wiki/University_of_New_South_Wales University of New South Wales] on [https://en.wikipedia.org/wiki/Non-monotonic_logic Non-monotonic logics] and their application.  
His research interests include symbolic [[Learning|machine learning]], [https://en.wikipedia.org/wiki/Inductive_logic_programming inductive logic programming (ILP)], implementation of ILP in particular the ILP systems ''Aleph'' <ref>[http://www.cs.ox.ac.uk/activities/machlearn/Aleph/aleph_toc.html The Aleph Manual]</ref> and ''P-Progol'' <ref>[http://www-ai.ijs.si/~ilpnet/systems/progol.html PROGOL (OxUni)]</ref>, [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics] and [https://en.wikipedia.org/wiki/Cheminformatics chemoinformatics] <ref>[http://www.cse.iitd.ernet.in/~ashwin/work/machlearn/ilp/applications.html Applications and Datasets]</ref>.  
+
His research interests include symbolic [[Learning|machine learning]], [https://en.wikipedia.org/wiki/Inductive_logic_programming inductive logic programming (ILP)], implementation of ILP in particular the ILP systems ''Aleph'' <ref>[[Ashwin Srinivasan]] ('''2001, 2007'''). ''[https://www.cs.ox.ac.uk/activities/programinduction/Aleph/aleph.html The aleph manual]''.</ref> and ''P-Progol'' <ref>[http://www-ai.ijs.si/~ilpnet/systems/progol.html PROGOL (OxUni)]</ref>, [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics] and [https://en.wikipedia.org/wiki/Cheminformatics chemoinformatics] <ref>[http://www.cse.iitd.ernet.in/~ashwin/work/machlearn/ilp/applications.html Applications and Datasets]</ref>.  
  
 
=ILP and Chess=
 
=ILP and Chess=
Line 20: Line 20:
 
==2000 ...==
 
==2000 ...==
 
* [[Michael Bain]], [[Stephen Muggleton]], [[Ashwin Srinivasan]] ('''2000'''). ''Generalising Closed World Specialisation: A Chess End Game Application''. [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3499 CitySeerX]
 
* [[Michael Bain]], [[Stephen Muggleton]], [[Ashwin Srinivasan]] ('''2000'''). ''Generalising Closed World Specialisation: A Chess End Game Application''. [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3499 CitySeerX]
 +
* [[Ashwin Srinivasan]] ('''2001, 2007'''). ''[https://www.cs.ox.ac.uk/activities/programinduction/Aleph/aleph.html The aleph manual]''.
 +
 
* [[Ashwin Srinivasan]] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/3-540-36468-4_16 The Applicability to ILP of Results Concerning the Ordering of Binomial Populations]''. [https://dblp.uni-trier.de/db/conf/ilp/ilp2002.html ILP 2002]
 
* [[Ashwin Srinivasan]] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/3-540-36468-4_16 The Applicability to ILP of Results Concerning the Ordering of Binomial Populations]''. [https://dblp.uni-trier.de/db/conf/ilp/ilp2002.html ILP 2002]
 
* [https://dblp.uni-trier.de/pers/hd/p/Page:David David Page], [[Ashwin Srinivasan]] ('''2003'''). ''ILP: A Short Look Back and a Longer Look Forward''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 4, [http://www.jmlr.org/papers/volume4/page03a/page03a.pdf pdf]
 
* [https://dblp.uni-trier.de/pers/hd/p/Page:David David Page], [[Ashwin Srinivasan]] ('''2003'''). ''ILP: A Short Look Back and a Longer Look Forward''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 4, [http://www.jmlr.org/papers/volume4/page03a/page03a.pdf pdf]
Line 29: Line 31:
  
 
=External Links=
 
=External Links=
 +
* [https://scholar.google.com.au/citations?user=zpNTeogAAAAJ&hl=en Ashwin Srinivasan - Google Scholar Citations]
 
* [http://www.cse.iitd.ernet.in/~ashwin/ Ashwin Srinivasan]
 
* [http://www.cse.iitd.ernet.in/~ashwin/ Ashwin Srinivasan]
 
: [http://www.cse.iitd.ernet.in/~ashwin/courses/lpl/index.html Logic Programming and Learning]
 
: [http://www.cse.iitd.ernet.in/~ashwin/courses/lpl/index.html Logic Programming and Learning]

Revision as of 15:45, 14 February 2019

Home * People * Ashwin Srinivasan

Ashwin Srinivasan [1]

Ashwin Srinivasan,
an Indian born, Australian-British electrical engineer, computer scientist, and senior professor of computer science at BITS-Pilani, Goa Campus [2], and previously research staff member at IBM India Research Lab [3] [4], New Delhi. He holds a Ph.D. from University of New South Wales on Non-monotonic logics and their application. His research interests include symbolic machine learning, inductive logic programming (ILP), implementation of ILP in particular the ILP systems Aleph [5] and P-Progol [6], bioinformatics and chemoinformatics [7].

ILP and Chess

Abstract from Distinguishing exceptions from noise in non-monotonic Learning [8]:

It is important for a learning program to have a reliable method of deciding whether to treat errors as noise or to include them as exceptions within a growing first-order theory. We explore the use of an information-theoretic measure to decide this problem within the non-monotonic learning framework defined by Closed-World-Specialisation. The approach adopted uses a model that consists of a reference Turing machine which accepts an encoding of a theory and proofs on its input tape and generates the observed data on the output tape. Within this model, the theory is said to `compress' data if the length of the input tape is shorter than that of the output tape. Data found to be incompressible are deemed to be `noise'. We use this feature to implement a compression-guided specialisation procedure that searches for the best-fitting theory for the data (that is, the one with the shortest input tape length). The approach is empirically evaluated on the standard Inductive Logic Programming problem of learning classification rules for the KRK chess endgame. 

Selected Publications

[9]

1990 ...

2000 ...

2010 ...

External Links

Logic Programming and Learning

References

Up one level