How users repeat their actions on computers: principles for design of history mechanisms
CHI '88 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
EAGER: programming repetitive tasks by example
CHI '91 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Text formatting by demonstration
CHI '91 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
The Utility of Knowledge in Inductive Learning
Machine Learning
C4.5: programs for machine learning
C4.5: programs for machine learning
A softbot-based interface to the Internet
Communications of the ACM
Creating charts by demonstration
CHI '94 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Repeat and predict—two keys to efficient text editing
CHI '94 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
CLIP: concept learning from inference patterns
Artificial Intelligence - Special issue: AI research in Japan
Automated user modeling for intelligent interface
International Journal of Human-Computer Interaction
Learning Logical Definitions from Relations
Machine Learning
Machine Learning
Letizia: an agent that assists web browsing
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Category translation: learning to understand information on the internet
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Basket Analysis for Graph Structured Data
PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
Graph-Based Induction for General Graph Structured Data
DS '99 Proceedings of the Second International Conference on Discovery Science
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Extracting frequent connected subgraphs from large graph sets
Journal of Computer Science and Technology
Predicting sentences using N-gram language models
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
An efficient algorithm of frequent connected subgraph extraction
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Learning to complete sentences
ECML'05 Proceedings of the 16th European conference on Machine Learning
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Hi-index | 0.00 |
In order to rank the performance of machine learning algorithms, many researchers conduct experiments on benchmark data sets. Since most learning algorithms have domain-specific parameters, it is a popular custom to adapt these parameters to obtain a ...