Learning Probabilistic Hierarchical Task Networks as Probabilistic Context-Free Grammars to Capture User Preferences
暂无分享,去创建一个
Subbarao Kambhampati | Nan Li | William Cushing | Sung Wook Yoon | S. Kambhampati | S. Yoon | W. Cushing | Nan Li
[1] Isabelle Guyon,et al. An Introduction to Variable and Feature Selection , 2003, J. Mach. Learn. Res..
[2] Mark Steedman,et al. On Natural Language Processing and Plan Recognition , 2007, IJCAI.
[3] Subbarao Kambhampati,et al. Learning Probabilistic Hierarchical Task Networks to Capture User Preferences , 2009, IJCAI.
[4] Terry L. Zimmerman,et al. Learning-Assisted Automated Planning: Looking Back, Taking Stock, Going Forward , 2003, AI Mag..
[5] David W. Aha,et al. CaMeL: Learning Method Preconditions for HTN Planning , 2002, AIPS.
[6] Nir Friedman,et al. Probabilistic Graphical Models - Principles and Techniques , 2009 .
[7] Loren Terveen,et al. Beyond Recommender Systems: Helping People Help Each Other , 2001 .
[8] Qiang Yang,et al. High-Level Goal Recognition in a Wireless LAN , 2004, AAAI.
[9] Kurt VanLehn,et al. A Version Space Approach to Learning Context-free Grammars , 1987, Machine Learning.
[10] Ian H. Witten,et al. Identifying Hierarchical Structure in Sequences: A linear-time algorithm , 1997, J. Artif. Intell. Res..
[11] Subbarao Kambhampati,et al. Domain Independent Approaches for Finding Diverse Plans , 2007, IJCAI.
[12] Olgierd Unold,et al. Learning context-free grammar using improved tabular representation , 2010, Appl. Soft Comput..
[13] Eugene Charniak,et al. A Maximum-Entropy-Inspired Parser , 2000, ANLP.
[14] Yishay Mansour,et al. An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering , 1997, UAI.
[15] Oren Etzioni,et al. A Sound and Fast Goal Recognizer , 1995, IJCAI.
[16] Lawrence B. Holder,et al. Substructure Discovery Using Minimum Description Length and Background Knowledge , 1993, J. Artif. Intell. Res..
[17] Yuji Takada. Grammatical Interface for Even Linear Languages Based on Control Sets , 1988, Inf. Process. Lett..
[18] L. Ungar,et al. Winner-Take-All EM Clustering , 2007 .
[19] Hector Muñoz-Avila,et al. HTN-MAKER: Learning HTNs with Minimal Additional Knowledge Engineering Required , 2008, AAAI.
[20] Hiroki Ishizaka. Learning simple deterministic languages , 1989, COLT '89.
[21] Dana S. Nau,et al. SHOP2: An HTN Planning System , 2003, J. Artif. Intell. Res..
[22] Andreas Stolcke,et al. Bayesian learning of probabilistic language models , 1994 .
[23] Subbarao Kambhampati,et al. Learning User Plan Preferences Obfuscated by Feasibility Constraints , 2009, ICAPS.
[24] Jorge A. Baier,et al. Planning with Preferences , 2008, AI Mag..
[25] Pat Langley,et al. Learning Context-Free Grammars with a Simplicity Bias , 2000, ECML.
[26] Michael Collins,et al. Three Generative, Lexicalised Models for Statistical Parsing , 1997, ACL.
[27] Christopher W. Geib,et al. Delaying Commitment in Plan Recognition Using Combinatory Categorial Grammars , 2009, IJCAI.
[28] Steve Young,et al. Applications of stochastic context-free grammars using the Inside-Outside algorithm , 1990 .
[29] Paolo Traverso,et al. Automated Planning: Theory & Practice , 2004 .
[30] J. Gerard Wolff,et al. Language acquisition, data compression and generalization , 1982 .
[31] Qiang Yang,et al. Learning Actions Models from Plan Examples with Incomplete Knowledge , 2005, ICAPS.
[32] Henry A. Kautz,et al. Generalized Plan Recognition , 1986, AAAI.
[33] K. VanLehn,et al. A version space approach to learning context-free grammars , 2004, Machine Learning.
[34] Nate Blaylock,et al. Corpus-based, Statistical Goal Recognition , 2003, IJCAI.
[35] Huan Liu,et al. Toward integrating feature selection algorithms for classification and clustering , 2005, IEEE Transactions on Knowledge and Data Engineering.
[36] Subbarao Kambhampati,et al. Hybrid Planning for Partially Hierarchical Domains , 1998, AAAI/IAAI.
[37] Hai Yang,et al. ACM Transactions on Intelligent Systems and Technology - Special Section on Urban Computing , 2014 .
[38] Dong-Yul Ra,et al. A New one Pass Algorithm for Estimating Stochastic Context-Free Grammars , 1999, Inf. Process. Lett..
[39] Richard K. Belew,et al. Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search , 1996, FOGA.
[40] Robert P. Goldman,et al. A Bayesian Model of Plan Recognition , 1993, Artif. Intell..
[41] Vladimir Solmon,et al. The estimation of stochastic context-free grammars using the Inside-Outside algorithm , 2003 .
[42] Pat Langley,et al. A Unified Cognitive Architecture for Physical Agents , 2006, AAAI.
[43] Yasubumi Sakakibara,et al. Efficient Learning of Context-Free Grammars from Positive Structural Examples , 1992, Inf. Comput..
[44] Patrik Haslum,et al. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners , 2009, Artif. Intell..
[45] James A. Hendler,et al. Complexity results for HTN planning , 1994, Annals of Mathematics and Artificial Intelligence.
[46] R. C. Underwood,et al. Stochastic context-free grammars for tRNA modeling. , 1994, Nucleic acids research.
[47] Jorge A. Baier,et al. HTN Planning with Preferences , 2009, IJCAI.
[48] Qiang Yang,et al. Learning recursive HTN-method structures for planning , 2007 .
[49] Ingrid Zukerman,et al. Bayesian Models for Keyhole Plan Recognition in an Adventure Game , 2004, User Modeling and User-Adapted Interaction.
[50] Michael P. Wellman,et al. Probabilistic State-Dependent Grammars for Plan Recognition , 2000, UAI.
[51] Bill Keller,et al. Evolutionary induction of stochastic context free grammars , 2005, Pattern Recognit..
[52] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[53] Anthony Barrett,et al. Task-Decomposition via Plan Parsing , 1994, AAAI.