113 search results - page 17 / 23 » Frequent subgraph pattern mining on uncertain graph data |
KDD
2005
ACM
14 years 7 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
TSE
2008
13 years 6 months ago
2008
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
KDD
1998
ACM
13 years 11 months ago
1998
ACM
We consider the problem of aggregation for uncertain and imprecise data. For such data, we define aggregation operators and use them to provide information on properties and patte...
DMIN
2006
13 years 8 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...