-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrefs.bib
50 lines (45 loc) · 1.73 KB
/
refs.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
@incollection{gspancuda,
title={Graph-based substructure pattern mining using CUDA dynamic parallelism},
author={Wang, Fei and Dong, Jianqiang and Yuan, Bo},
booktitle={Intelligent Data Engineering and Automated Learning--IDEAL 2013},
pages={342--349},
year={2013},
publisher={Springer}
}
@inproceedings{gspan,
title={gspan: Graph-based substructure pattern mining},
author={Yan, Xifeng and Han, Jiawei},
booktitle={Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on},
pages={721--724},
year={2002},
organization={IEEE}
}
@inproceedings{shafem,
author = {Vu, Lan and Alaghband, Gita},
title = {Novel Parallel Method for Mining Frequent Patterns on Multi-core Shared Memory Systems},
booktitle = {Proceedings of the 2013 International Workshop on Data-Intensive Scalable Computing Systems},
series = {DISCS-2013},
year = {2013},
isbn = {978-1-4503-2506-6},
location = {Denver, Colorado},
pages = {49--54},
numpages = {6},
url = {http://doi.acm.org/10.1145/2534645.2534653},
doi = {10.1145/2534645.2534653},
acmid = {2534653},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {association rule mining, databases, frequent pattern mining, multi-core, parallel algorithm, shared memory},
}
@inproceedings{cook1971complexity,
title={The complexity of theorem-proving procedures},
author={Cook, Stephen A},
booktitle={Proceedings of the third annual ACM symposium on Theory of computing},
pages={151--158},
year={1971},
organization={ACM}
}
@techreport{buehrer2005parallel,
title={Parallel graph mining on shared memory architectures},
author={Buehrer, Gregory and Parthasarathy, Srinivasan and Nguyen, Anthony and Kim, Daehyun and Chen, Yen-Kuang and Dubey, Pradeep}
}