25,161
edits
Changes
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>[..."
'''[[Main Page|Home]] * [[People]] * Ashwin Srinivasan'''
[[FILE:ashwin.srinivasan.JPG|border|right|thumb|link=http://www.cse.iitd.ernet.in/~ashwin/| Ashwin Srinivasan <ref>[http://www.cse.iitd.ernet.in/~ashwin/ Ashwin Srinivasan at IBM]</ref> ]]
'''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].
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>.
=ILP and Chess=
Abstract from ''Distinguishing exceptions from noise in non-monotonic Learning'' <ref>[[Ashwin Srinivasan]], [[Stephen Muggleton]], [[Michael Bain]] ('''1992'''). ''Distinguishing exceptions from noise in non-monotonic Learning''. [http://www.cs.york.ac.uk/ILP-events/ILP-1992/ ILP92]</ref>:
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=
<ref>[https://dblp.uni-trier.de/pers/hd/s/Srinivasan:Ashwin dblp: Ashwin Srinivasan]</ref>
==1990 ...==
* [[Ashwin Srinivasan]], [[Stephen Muggleton]], [[Michael Bain]] ('''1992'''). ''Distinguishing exceptions from noise in non-monotonic Learning''. [http://www.cs.york.ac.uk/ILP-events/ILP-1992/ ILP92], [https://pdfs.semanticscholar.org/fd37/06021c2230104a6f89cc93b341b7896e26bb.pdf pdf]
* [[Michael Bain]], [[Ashwin Srinivasan]] ('''1995'''). ''Inductive logic programming with large-scale unstructured data''. [http://www.doc.ic.ac.uk/~shm/MI/mi14.html Machine Intelligence 14]
* [[Ashwin Srinivasan]] ('''1999'''). ''A study of two sampling methods for analysing large datasets with ILP''. [http://www.springerlink.com/content/100254/?MUD=MP Data Mining and Knowledge Discovery], Vol. 3, No. 1
==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]
* [[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]
* [[Ashwin Srinivasan]] ('''2005'''). ''[https://link.springer.com/chapter/10.1007/11536314_28 Five Problems in Five Areas for Five Years]''. [https://dblp.uni-trier.de/db/conf/ilp/ilp2005.html ILP 2005]
==2010 ...==
* [[Stephen Muggleton]], [https://people.cs.kuleuven.be/~luc.deraedt/ Luc De Raedt], [https://dblp.uni-trier.de/pers/hd/p/Poole_0001:David David Poole], [[Ivan Bratko]], [https://en.wikipedia.org/wiki/Peter_Flach Peter A. Flach], [http://research.nii.ac.jp/~inoue/official/content_e.html Katsumi Inoue], [[Ashwin Srinivasan]] ('''2012'''). ''[https://link.springer.com/article/10.1007/s10994-011-5259-2 ILP turns 20 - Biography and future challenges]''. [https://en.wikipedia.org/wiki/Machine_Learning_(journal) Machine Learning], Vol. 86, No. 1
* [[Ashwin Srinivasan]], [[Lovekesh Vig]], [[Michael Bain]] ('''2018'''). ''Logical Explanations for Deep Relational Machines Using Relevance Information''. [https://arxiv.org/abs/1807.00595 arXiv:1807.00595]
* [[Michael Bain]], [[Ashwin Srinivasan]] ('''2018'''). ''[https://link.springer.com/article/10.1007/s10994-018-5709-1 Identification of biological transition systems using meta-interpreted logic programs]''. [https://en.wikipedia.org/wiki/Machine_Learning_(journal) Machine Learning], Vol. 107, No. 7 <ref>[https://en.wikipedia.org/wiki/Operational_semantics Operational semantics from Wikipedia]</ref>
=External Links=
* [http://www.cse.iitd.ernet.in/~ashwin/ Ashwin Srinivasan]
: [http://www.cse.iitd.ernet.in/~ashwin/courses/lpl/index.html Logic Programming and Learning]
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Researcher|Srinivasan]]
[[FILE:ashwin.srinivasan.JPG|border|right|thumb|link=http://www.cse.iitd.ernet.in/~ashwin/| Ashwin Srinivasan <ref>[http://www.cse.iitd.ernet.in/~ashwin/ Ashwin Srinivasan at IBM]</ref> ]]
'''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].
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>.
=ILP and Chess=
Abstract from ''Distinguishing exceptions from noise in non-monotonic Learning'' <ref>[[Ashwin Srinivasan]], [[Stephen Muggleton]], [[Michael Bain]] ('''1992'''). ''Distinguishing exceptions from noise in non-monotonic Learning''. [http://www.cs.york.ac.uk/ILP-events/ILP-1992/ ILP92]</ref>:
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=
<ref>[https://dblp.uni-trier.de/pers/hd/s/Srinivasan:Ashwin dblp: Ashwin Srinivasan]</ref>
==1990 ...==
* [[Ashwin Srinivasan]], [[Stephen Muggleton]], [[Michael Bain]] ('''1992'''). ''Distinguishing exceptions from noise in non-monotonic Learning''. [http://www.cs.york.ac.uk/ILP-events/ILP-1992/ ILP92], [https://pdfs.semanticscholar.org/fd37/06021c2230104a6f89cc93b341b7896e26bb.pdf pdf]
* [[Michael Bain]], [[Ashwin Srinivasan]] ('''1995'''). ''Inductive logic programming with large-scale unstructured data''. [http://www.doc.ic.ac.uk/~shm/MI/mi14.html Machine Intelligence 14]
* [[Ashwin Srinivasan]] ('''1999'''). ''A study of two sampling methods for analysing large datasets with ILP''. [http://www.springerlink.com/content/100254/?MUD=MP Data Mining and Knowledge Discovery], Vol. 3, No. 1
==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]
* [[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]
* [[Ashwin Srinivasan]] ('''2005'''). ''[https://link.springer.com/chapter/10.1007/11536314_28 Five Problems in Five Areas for Five Years]''. [https://dblp.uni-trier.de/db/conf/ilp/ilp2005.html ILP 2005]
==2010 ...==
* [[Stephen Muggleton]], [https://people.cs.kuleuven.be/~luc.deraedt/ Luc De Raedt], [https://dblp.uni-trier.de/pers/hd/p/Poole_0001:David David Poole], [[Ivan Bratko]], [https://en.wikipedia.org/wiki/Peter_Flach Peter A. Flach], [http://research.nii.ac.jp/~inoue/official/content_e.html Katsumi Inoue], [[Ashwin Srinivasan]] ('''2012'''). ''[https://link.springer.com/article/10.1007/s10994-011-5259-2 ILP turns 20 - Biography and future challenges]''. [https://en.wikipedia.org/wiki/Machine_Learning_(journal) Machine Learning], Vol. 86, No. 1
* [[Ashwin Srinivasan]], [[Lovekesh Vig]], [[Michael Bain]] ('''2018'''). ''Logical Explanations for Deep Relational Machines Using Relevance Information''. [https://arxiv.org/abs/1807.00595 arXiv:1807.00595]
* [[Michael Bain]], [[Ashwin Srinivasan]] ('''2018'''). ''[https://link.springer.com/article/10.1007/s10994-018-5709-1 Identification of biological transition systems using meta-interpreted logic programs]''. [https://en.wikipedia.org/wiki/Machine_Learning_(journal) Machine Learning], Vol. 107, No. 7 <ref>[https://en.wikipedia.org/wiki/Operational_semantics Operational semantics from Wikipedia]</ref>
=External Links=
* [http://www.cse.iitd.ernet.in/~ashwin/ Ashwin Srinivasan]
: [http://www.cse.iitd.ernet.in/~ashwin/courses/lpl/index.html Logic Programming and Learning]
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Researcher|Srinivasan]]
