Остановите войну!
for scientists:
default search action
Chowdhury Farhan Ahmed
Publications
- 2014
- [j12]Tahrima Hashem, Chowdhury Farhan Ahmed, Md. Samiullah, Sayma Akther, Byeong-Soo Jeong, Seokhee Jeon:
An efficient approach for mining cross-level closed itemsets and minimal association rules using closed itemset lattices. Expert Syst. Appl. 41(6): 2914-2938 (2014) - 2013
- [j11]Manziba Akanda Nishi, Chowdhury Farhan Ahmed, Md. Samiullah, Byeong-Soo Jeong:
Effective periodic pattern mining in time series databases. Expert Syst. Appl. 40(8): 3015-3027 (2013) - 2012
- [j10]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee, Ho-Jin Choi:
Single-pass incremental and interactive mining for weighted frequent patterns. Expert Syst. Appl. 39(9): 7976-7994 (2012) - [j9]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Ho-Jin Choi:
Interactive mining of high utility patterns over data streams. Expert Syst. Appl. 39(15): 11979-11991 (2012) - [c18]Shariful Islam, Anna Fariha, Chowdhury Farhan Ahmed, Byeong-Soo Jeong:
EGDIM: evolving graph database indexing method. ICUIMC 2012: 56:1-56:10 - 2011
- [j8]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
HUC-Prune: an efficient candidate pruning technique to mine high utility patterns. Appl. Intell. 34(2): 181-198 (2011) - [j7]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Ho-Jin Choi:
A framework for mining interesting high utility patterns with a strong frequency affinity. Inf. Sci. 181(21): 4878-4894 (2011) - 2010
- [c17]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong:
An Efficient Method for Incremental Mining of Share-Frequent Patterns. APWeb 2010: 147-153 - [c16]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong:
Mining Regular Patterns in Incremental Transactional Databases. APWeb 2010: 375-377 - [c15]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong:
Mining Regular Patterns in Data Streams. DASFAA (1) 2010: 399-413 - [c14]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong:
Mining High Utility Web Access Sequences in Dynamic Web Log Data. SNPD 2010: 76-81 - 2009
- [j6]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
An Efficient Algorithm for Sliding Window-Based Weighted Frequent Pattern Mining over Data Streams. IEICE Trans. Inf. Syst. 92-D(7): 1369-1381 (2009) - [j5]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Efficient single-pass frequent pattern mining using a prefix-tree. Inf. Sci. 179(5): 559-583 (2009) - [j4]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Sliding window-based frequent pattern mining over data streams. Inf. Sci. 179(22): 3843-3865 (2009) - [j3]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases. IEEE Trans. Knowl. Data Eng. 21(12): 1708-1721 (2009) - [c13]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong:
Efficient Mining of Weighted Frequent Patterns over Data Streams. HPCC 2009: 400-406 - [c12]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong:
Parallel and Distributed Frequent Pattern Mining in Large Databases. HPCC 2009: 407-414 - [c11]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Mining high utility patterns in incremental databases. ICUIMC 2009: 656-663 - [c10]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Discovering Periodic-Frequent Patterns in Transactional Databases. PAKDD 2009: 242-253 - [c9]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
An Efficient Candidate Pruning Technique for High Utility Pattern Mining. PAKDD 2009: 749-756 - 2008
- [j2]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Mining Regular Patterns in Transactional Databases. IEICE Trans. Inf. Syst. 91-D(11): 2568-2577 (2008) - [j1]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Handling Dynamic Weights in Weighted Frequent Pattern Mining. IEICE Trans. Inf. Syst. 91-D(11): 2578-2588 (2008) - [c8]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Efficient Single-Pass Mining of Weighted Interesting Patterns. Australasian Conference on Artificial Intelligence 2008: 404-415 - [c7]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns. AusDM 2008: 79-86 - [c6]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Efficient frequent pattern mining over data streams. CIKM 2008: 1447-1448 - [c5]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
RP-Tree: A Tree Structure to Discover Regular Patterns in Transactional Database. IDEAL 2008: 193-200 - [c4]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Mining Weighted Frequent Patterns Using Adaptive Weights. IDEAL 2008: 258-265 - [c3]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining. PAKDD 2008: 1022-1027 - [c2]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Mining Weighted Frequent Patterns in Incremental Databases. PRICAI 2008: 933-938
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-22 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint