From: Mart Lubbers Date: Mon, 24 Nov 2014 12:29:10 +0000 (+0100) Subject: update bib X-Git-Url: https://git.martlubbers.net/?a=commitdiff_plain;h=24b6df0053aaa04a313f34f3327dcae525c5d1e7;p=bsc-thesis1415.git update bib --- diff --git a/thesis2/thesis.bib b/thesis2/thesis.bib index 4685c39..ef9957f 100644 --- a/thesis2/thesis.bib +++ b/thesis2/thesis.bib @@ -1,14 +1,28 @@ +@article{Agnihotri2014, +author = {Agnihotri, Deepak and Verma, Kesari and Tripathi, Priyanka}, +doi = {10.1109/CSNT.2014.92}, +file = {:home/mart/articles/2014/Agnihotri, Verma, Tripathi\_Pattern and Cluster Mining on Text Data.pdf:pdf}, +isbn = {978-1-4799-3070-8}, +journal = {2014 Fourth International Conference on Communication Systems and Network Technologies}, +keywords = {- text mining,1,2,3,4,5,analytics,and analytical methods,essentially,into data for analysis,language,nlp,processing,stemming,stop words,text mining, stop words, stemming, TF - IDF, Clust,tf,the overarching goal is,to turn text,via application of natural}, +month = apr, +pages = {428--432}, +publisher = {Ieee}, +title = {{Pattern and Cluster Mining on Text Data}}, +url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6821432}, +year = {2014} +} @inproceedings{Aitken2002, author = {Aitken, James Stuart}, booktitle = {Proceedings of the 15th Eureopean Conference on Artificial Intelligence}, -file = {:home/mart/articles/2002/2002\_Aitken\_Learning Information Extraction Rules An Inductive Logic Programming approach.pdf:pdf}, +file = {:home/mart/articles/2002/Aitken\_Learning Information Extraction Rules An Inductive Logic Programming approach.pdf:pdf}, title = {{Learning Information Extraction Rules : An Inductive Logic Programming approach}}, year = {2002} } @article{Berry1986, author = {Berry, Gerard and Sethi, Ravi}, doi = {10.1016/0304-3975(86)90088-5}, -file = {:home/mart/articles/1986/1986\_Berry, Sethi\_From regular expressions to deterministic automata.pdf:pdf}, +file = {:home/mart/articles/1986/Berry, Sethi\_From regular expressions to deterministic automata.pdf:pdf}, issn = {03043975}, journal = {Theoretical Computer Science}, month = jan, @@ -23,7 +37,7 @@ archivePrefix = {arXiv}, arxivId = {arXiv:1010.5318v3}, author = {Berstel, Jean and Boasson, Luc and Carton, Olivier and Fagnot, Isabelle}, eprint = {arXiv:1010.5318v3}, -file = {:home/mart/articles/2010/2010\_Berstel et al.\_Minimization of automata.pdf:pdf}, +file = {:home/mart/articles/2010/Berstel et al.\_Minimization of automata.pdf:pdf}, journal = {Mathematics Subject Classification}, keywords = {finite automata,hopcroft,minimization,s algorithm}, title = {{Minimization of automata}}, @@ -31,7 +45,7 @@ year = {2010} } @article{Bruggemann-klein1993, author = {Br\"{u}ggemann-klein, Anne}, -file = {:home/mart/articles/1993/1993\_Br\"{u}ggemann-klein\_Regular expressions into finite automata.pdf:pdf}, +file = {:home/mart/articles/1993/Br\"{u}ggemann-klein\_Regular expressions into finite automata.pdf:pdf}, journal = {Theoretical Computer Science}, pages = {197--213}, title = {{Regular expressions into finite automata}}, @@ -41,7 +55,7 @@ year = {1993} @article{Daciuk2000, author = {Daciuk, Jan and Mihov, Stoyan and Watson, Bruce W. and Watson, Richard E.}, doi = {10.1162/089120100561601}, -file = {:home/mart/articles/2000/2000\_Daciuk et al.\_Incremental Construction of Minimal Acyclic Finite-State Automata.pdf:pdf}, +file = {:home/mart/articles/2000/Daciuk et al.\_Incremental Construction of Minimal Acyclic Finite-State Automata.pdf:pdf}, issn = {0891-2017}, journal = {Computational Linguistics}, month = mar, @@ -52,21 +66,15 @@ url = {http://www.mitpressjournals.org/doi/abs/10.1162/089120100561601}, volume = {26}, year = {2000} } -@article{Grootjen2014, -author = {Grootjen, Franc and Otworowska, Maria}, -file = {:home/mart/articles/2014/2014\_Grootjen, Otworowska\_Proceedings of the 26th Benelux Conference on Artificial Intelligence.pdf:pdf}, -title = {{Proceedings of the 26th Benelux Conference on Artificial Intelligence}}, -year = {2014} -} @techreport{Hopcroft1971, author = {Hopcroft, John}, -file = {:home/mart/articles/1971/1971\_Hopcroft\_An N log N algorithm for minimizing states in a finite automaton.pdf:pdf}, +file = {:home/mart/articles/1971/Hopcroft\_An N log N algorithm for minimizing states in a finite automaton.pdf:pdf}, title = {{An N log N algorithm for minimizing states in a finite automaton}}, year = {1971} } @article{Hromkovic2001, author = {Hromkovic, Juraj and Seibert, Sebastian and Wilke, Thomas}, -file = {:home/mart/articles/2001/2001\_Hromkovic, Seibert, Wilke\_Translating Regular Expressions into Small = - Free Nondeterministic Finite Automata.pdf:pdf}, +file = {:home/mart/articles/2001/Hromkovic, Seibert, Wilke\_Translating Regular Expressions into Small = - Free Nondeterministic Finite Automata.pdf:pdf}, journal = {Journal of Computer and System Sciences}, keywords = {finite automata,regular expressions}, pages = {565--588}, @@ -77,7 +85,7 @@ year = {2001} @article{Knuutila2001, author = {Knuutila, Timo}, doi = {10.1016/S0304-3975(99)00150-4}, -file = {:home/mart/articles/2001/2001\_Knuutila\_Re-describing an algorithm by Hopcroft.pdf:pdf}, +file = {:home/mart/articles/2001/Knuutila\_Re-describing an algorithm by Hopcroft.pdf:pdf}, issn = {03043975}, journal = {Theoretical Computer Science}, keywords = {algorithms,finite automata,minimization}, @@ -91,14 +99,14 @@ year = {2001} } @article{Roelofs2008, author = {Roelofs, Wouter}, -file = {:home/mart/articles/2008/2008\_Roelofs\_HyperBot Building Web Robots for Non-Programmers.pdf:pdf}, +file = {:home/mart/articles/2005/Roelofs\_HyperBot Building Web Robots for Non-Programmers.pdf:pdf}, title = {{HyperBot Building Web Robots for Non-Programmers}}, year = {2008} } @inproceedings{Roelofs2009, author = {Roelofs, Wouter and Paula, Alessandro Tadeo and Grootjen, Franc}, booktitle = {Proceedings of the Dutch Information Retrieval Conference}, -file = {:home/mart/articles/2009/2009\_Roelofs, Paula, Grootjen\_Programming by Clicking.pdf:pdf}, +file = {:home/mart/articles/2009/Roelofs, Paula, Grootjen\_Programming by Clicking.pdf:pdf}, keywords = {levenshtein matching,subtree matching,web crawler}, pages = {2--3}, title = {{Programming by Clicking}}, @@ -106,7 +114,7 @@ year = {2009} } @article{Science1985, author = {Science, Computer}, -file = {:home/mart/articles/1985/1985\_Science\_A. e h r e n f e u c h t •.pdf:pdf}, +file = {:home/mart/articles/1985/Science\_A. e h r e n f e u c h t •.pdf:pdf}, pages = {31--55}, title = {{A. e h r e n f e u c h t •}}, volume = {40}, @@ -114,6 +122,6 @@ year = {1985} } @article{Watson, author = {Watson, Bruce W and Science, Computing and Eindhoven, Technische Universiteit}, -file = {:home/mart/articles/Unknown/Unknown\_Watson, Science, Eindhoven\_Constructing minimal acyclic deterministic finite automata.pdf:pdf}, +file = {:home/mart/articles/Unknown/Watson, Science, Eindhoven\_Constructing minimal acyclic deterministic finite automata.pdf:pdf}, title = {{Constructing minimal acyclic deterministic finite automata}} }