Sciweavers

97 search results - page 16 / 20
» Frequent free tree discovery in graph data
Sort
View
DASFAA
2005
IEEE
166views Database» more  DASFAA 2005»
14 years 1 months ago
NNF: An Effective Approach in Medicine Paring Analysis of Traditional Chinese Medicine Prescriptions
Medicine Paring Analysis is one of the most important tasks in the research of Traditional Chinese Medicine Prescriptions. The most essential and difficult step is to mine associat...
Chuan Li, Changjie Tang, Jing Peng, Jianjun Hu, Yo...
21
Voted
BMCBI
2010
172views more  BMCBI 2010»
13 years 7 months ago
Inferring gene regression networks with model trees
Background: Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to f...
Isabel A. Nepomuceno-Chamorro, Jesús S. Agu...
AIIA
2005
Springer
14 years 1 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
CIKM
2008
Springer
13 years 9 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han