Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patterns and then use these as features to build predictive models. Rather than building these models in a two step indirect way, the SMIREP system introduced in this paper, derives predictive rule models from molecular data directly. SMIREP combines the SMILES and SMARTS representation languages that are popular in computational chemistry with the IREP rule-learning algorithm by Fürnkranz. Even though SMIREP is focused on SMILES, its principles are also applicable to graph mining problems in other domains. SMIREP is experimentally evaluated on two benchmark databases.
International audienceThe article introduces an original problem of knowledge discovery from chemica...
Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting pattern...
Chemistry today has to face a critical challenge, whose success necessitates high-performance comput...
Graph mining approaches are extremely popular and effective in molecular databases. The vast majorit...
Most approaches to structure-activity-relationship (SAR) prediction proceed in two steps. In the fir...
Most approaches to structure-activity-relationship (SAR) prediction proceed in two steps. In the fir...
Learning from graphs has become a popular research area due to the ubiquity of graph data representi...
Several domains are inherently structural; relevant data cannot be represented as a single table wit...
In many real-world problems, one deals with input or output data that are structured. This thesis in...
Graph mining is the study of how to perform data mining and machine learning on data represented wit...
We propose a new boosting method that systematically combines graph mining and mathematical programm...
Mining frequent structural patterns from graph databases is an important research problem with broad...
Drug discovery is an expensive and labor-intensive process, typically taking an average of 10–15 yea...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
Pattern mining methods for graph data have largely been restricted to ground features, such as frequ...
International audienceThe article introduces an original problem of knowledge discovery from chemica...
Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting pattern...
Chemistry today has to face a critical challenge, whose success necessitates high-performance comput...
Graph mining approaches are extremely popular and effective in molecular databases. The vast majorit...
Most approaches to structure-activity-relationship (SAR) prediction proceed in two steps. In the fir...
Most approaches to structure-activity-relationship (SAR) prediction proceed in two steps. In the fir...
Learning from graphs has become a popular research area due to the ubiquity of graph data representi...
Several domains are inherently structural; relevant data cannot be represented as a single table wit...
In many real-world problems, one deals with input or output data that are structured. This thesis in...
Graph mining is the study of how to perform data mining and machine learning on data represented wit...
We propose a new boosting method that systematically combines graph mining and mathematical programm...
Mining frequent structural patterns from graph databases is an important research problem with broad...
Drug discovery is an expensive and labor-intensive process, typically taking an average of 10–15 yea...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
Pattern mining methods for graph data have largely been restricted to ground features, such as frequ...
International audienceThe article introduces an original problem of knowledge discovery from chemica...
Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting pattern...
Chemistry today has to face a critical challenge, whose success necessitates high-performance comput...