#### Filter Results:

#### Publication Year

2012

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—Graphlet frequency distribution (GFD) has recently become popular for characterizing large networks. However, the computation of GFD for a network requires the exact count of embedded graphlets in that network, which is a computationally expensive task. As a result, it is practically infeasible to compute the GFD for even a moderately large network. In… (More)

- Rui Chen, Christos Faloutsos, Ferit Akova, Murat Dundar, Yuan Qi, Bartek Rajwa +73 others
- 2013

Graphlet frequency distribution (GFD) has recently become popular for characterizing large networks. However, the computation of GFD for a network requires the exact count of embedded graphlets in that network, which is a computationally expensive task. As a result, it is practically infeasible to compute the GFD for even a moderately large network. In this… (More)

—Traditional data mining mechanisms with their robustly defined classification techniques have certain limitations to express to what extent the class labels of the test data hold. This problem leads to the fact that a false positive or false negative data point has no quantitative value to express to what degree it is false/true. This situation becomes… (More)

- ‹
- 1
- ›