Petre Tzvetkov
Loading Google Thumbnails...
from Google Images |
- Sorted by Year/Conf, Year/Citation, Citation
| 2005 | ||
|---|---|---|
| 4 | TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets. Jianyong Wang, Jiawei Han, Ying Lu, Petre Tzvetkov. IEEE Trans. Knowl. Data Eng. (17): 652-664 (2005). Cited by 50Web SearchBibTeXDownload | |
| 3 | TSP: Mining top-k closed sequential patterns. Petre Tzvetkov, Xifeng Yan, Jiawei Han. Knowl. Inf. Syst. (7): 438-457 (2005). Cited by 97Web SearchBibTeXDownload | |
| 2003 | ||
| 2 | TSP: Mining Top-K Closed Sequential Patterns. Petre Tzvetkov, Xifeng Yan, Jiawei Han. ICDM 2003, 347-354. Web SearchBibTeXDownload | |
| 2002 | ||
| 1 | Mining Top-K Frequent Closed Patterns without Minimum Support. Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov. ICDM 2002, 211-218. Cited by 116Web SearchBibTeXDownload | |
from DBLP and Google Scholar