-
1
-
-
77956260197
-
GConnect: A connectivity index for massive diskresident graphs
-
Aggarwal, C., Yan, X., Yu, P.S.: GConnect: A connectivity index for massive diskresident graphs. In: Very Large Databases (VLDB), vol. 2, pp. 862-873 (2009)
-
(2009)
Very Large Databases (VLDB)
, vol.2
, pp. 862-873
-
-
Aggarwal, C.1
Yan, X.2
Yu, P.S.3
-
2
-
-
12244251830
-
Scalable mining of large disk-based graph databases
-
Chen, W., et al.: Scalable mining of large disk-based graph databases. In: ACM Knowledge Discovery and Data Mining (SIGKDD), pp. 316-325 (2004)
-
(2004)
ACM Knowledge Discovery and Data Mining (SIGKDD
, pp. 316-325
-
-
Chen, W.1
-
3
-
-
7444254104
-
DB-subdue: Database approach to graph mining
-
Advances in Knowledge Discovery and Data Mining
-
Chakravarthy, S., Beera, R., Balachandran, R.: DB-Subdue: Database approach to graph mining. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 341-350. Springer, Heidelberg (2004) (Pubitemid 38824917)
-
(2004)
Lecture Notes in Computer Science
, Issue.3056
, pp. 341-350
-
-
Chakravarthy, S.1
Beera, R.2
Balachandran, R.3
-
4
-
-
52949121451
-
DB-FSG: An SQL-based approach for frequent subgraph mining
-
Bhowmick, S.S., Küng, J., Wagner, R. (eds.) DEXA 2008. Springer, Heidelberg
-
Chakravarthy, S., Pradhan, S.: DB-FSG: An SQL-based approach for frequent subgraph mining. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds.) DEXA 2008. LNCS, vol. 5181, pp. 684-692. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5181
, pp. 684-692
-
-
Chakravarthy, S.1
Pradhan, S.2
-
5
-
-
57149132520
-
Efficiently answering reachability queries on very large directed graphs
-
Jin, R., et al.: Efficiently answering reachability queries on very large directed graphs. In: ACM Management of Data (SIGMOD), pp. 595-608 (2008)
-
(2008)
ACM Management of Data (SIGMOD)
, pp. 595-608
-
-
Jin, R.1
-
6
-
-
35248818313
-
Performance evaluation and analysis of K-way join variants for association rule mining
-
Mishra, P., Chakravarthy, S.: Performance evaluation and analysis of k-way join variants for association rule mining. In: James, A., Younas, M., Lings, B. (eds.) BNCOD 2003. LNCS, vol. 2712, pp. 95-114. Springer, Heidelberg (2003) (Pubitemid 137633860)
-
(2003)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.2712
, pp. 95-114
-
-
Mishra, P.1
Chakravarthy, S.2
-
7
-
-
79956300437
-
-
Network datasets, http://snap.stanford.edu/data/index.html
-
Network Datasets
-
-
-
8
-
-
79956298621
-
-
Oracle PL/SQL, http://www.oracle.com/technology/tech/pl-sql/index.html
-
-
-
-
9
-
-
0032094477
-
Integrating association rule mining with relational database systems: Alternatives and implications
-
Sarawagi, S., Thomas, S., Agarwal, R.: Integrating mining with relational database systems: Alternatives and implications. In: ACM Management of Data (SIGMOD), pp. 343-354 (1998) (Pubitemid 128655981)
-
(1998)
SIGMOD Record
, vol.27
, Issue.2
, pp. 343-354
-
-
Sarawagi, S.1
Thomas, S.2
Agrawal, R.3
-
10
-
-
77957970500
-
Detecting hubs and quasi cliques in scale-free networks
-
Srihari, S., Ng, H.K., Ning, K., Leong, H.W.: Detecting hubs and quasi cliques in scale-free networks. In: IEEE Pattern Recognition (ICPR), pp. 1-4 (2008)
-
(2008)
IEEE Pattern Recognition (ICPR)
, pp. 1-4
-
-
Srihari, S.1
Ng, H.K.2
Ning, K.3
Leong, H.W.4
|