default search action
Chowdhury Farhan Ahmed
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j33]Md. Ashraful Islam
, Chowdhury Farhan Ahmed
Graph-based substructure pattern mining with edge-weight. Appl. Intell. 54(5): 3756-3785 (2024) - [j32]Redwan Ahmed Rizvee
A new tree-based approach to mine sequential patterns. Expert Syst. Appl. 242: 122754 (2024) - [j31]Md. Tanvir Alam
Discovering Interesting Patterns from Hypergraphs. ACM Trans. Knowl. Discov. Data 18(1): 32:1-32:34 (2024) - [c52]Wakilur Islam, Md. Rezaul Karim, Md. Samiullah, Chowdhury Farhan Ahmed, Carson K. Leung, Adam G. M. Pazdor, Connor C. J. Hryhoruk:
An Efficient Approach to Learn an Effective Hierarchy of a Set of OOBN Classes. IMCOM 2024: 1-8 - [c51]Sartaj Solaiman, B. M. Obaydur Rahman, Md. Fahim Arefin, Chowdhury Farhan Ahmed, Carson K. Leung, Evan W. R. Madill:
Unveiling Market Sentiments: A Comprehensive Analysis of Stock Market Responses to Diverse News Events Using Data Mining Techniques. IMCOM 2024: 1-8 - [i2]Kashob Kumar Roy, Md Hasibul Haque Moon, Md Mahmudur Rahman, Chowdhury Farhan Ahmed, Carson Kai-Sang Leung:
Mining Weighted Sequential Patterns in Incremental Uncertain Databases. CoRR abs/2404.00746 (2024) - [i1]Kashob Kumar Roy, Md Hasibul Haque Moon, Md Mahmudur Rahman, Chowdhury Farhan Ahmed, Carson K. Leung:
Mining Sequential Patterns in Uncertain Databases Using Hierarchical Index Structure. CoRR abs/2404.01347 (2024) - 2023
- [j30]Md. Tanvir Alam
UGMINE: utility-based graph mining. Appl. Intell. 53(1): 49-68 (2023) - [j29]Md. Sahidul Islam, Pankaj Chandra Kar, Mohammad Samiullah
Discovering probabilistically weighted sequential patterns in uncertain databases. Appl. Intell. 53(6): 6525-6553 (2023) - [c50]A. M. Aahad, Khondker Bin Yamin, Md. Samiullah, Chowdhury Farhan Ahmed, Carson K. Leung, Evan W. R. Madill, Adam G. M. Pazdor:
Connectable and Independent Junction Tree-Based Compilation Technique of Object-Oriented Bayesian Networks. ICTAI 2023: 221-228 - 2022
- [j28]Sabrina Zaman Ishita, Chowdhury Farhan Ahmed
New approaches for mining regular high utility sequential patterns. Appl. Intell. 52(4): 3781-3806 (2022) - [j27]Kashob Kumar Roy
Mining weighted sequential patterns in incremental uncertain databases. Inf. Sci. 582: 865-896 (2022) - [j26]Mohammad Ehsan Shahmi Chowdhury, Chowdhury Farhan Ahmed, Carson K. Leung
A New Approach for Mining Correlated Frequent Subgraphs. ACM Trans. Manag. Inf. Syst. 13(1): 9:1-9:28 (2022) - [c49]Mohammad Fahim Arefin, Chowdhury Farhan Ahmed, Redwan Ahmed Rizvee, Carson K. Leung
Mining Contextual Item Similarity without Concept Hierarchy. IMCOM 2022: 1-8 - 2021
- [c48]Riddho Ridwanul Haque, Chowdhury Farhan Ahmed, Md. Samiullah, Carson K. Leung:
UFreS: A New Technique for Discovering Frequent Subgraph Patterns in Uncertain Graph Databases. ICBK 2021: 253-260 - [c47]Md. Tanvir Alam
Mining High Utility Subgraphs. ICDM (Workshops) 2021: 566-573 - [c46]Md. Tanvir Alam
Mining Frequent Patterns from Hypergraph Databases. PAKDD (2) 2021: 3-15 - [c45]Md. Tanvir Alam
Discriminating Frequent Pattern Based Supervised Graph Embedding for Classification. PAKDD (2) 2021: 16-28 - [c44]Kashob Kumar Roy
Mining Sequential Patterns in Uncertain Databases Using Hierarchical Index Structure. PAKDD (2) 2021: 29-41 - 2020
- [c43]Redwan Ahmed Rizvee, Mohammad Fahim Arefin
Tree-Miner: Mining Sequential Patterns from SP-Tree. PAKDD (2) 2020: 44-56
2010 – 2019
- 2019
- [j25]Tahira Alam
An Effective Recursive Technique for Multi-Class Classification and Regression for Imbalanced Data. IEEE Access 7: 127615-127630 (2019) - [j24]Md Mahmudur Rahman
Mining weighted frequent sequences in uncertain databases. Inf. Sci. 479: 76-100 (2019) - [c42]Sabrina Zaman Ishita, Chowdhury Farhan Ahmed, Carson K. Leung
Mining Regular High Utility Sequential Patterns in Static and Dynamic Databases. IMCOM 2019: 897-916 - [c41]Jesan Ahammed Ovi, Chowdhury Farhan Ahmed, Carson K. Leung
Mining Weighted Frequent Patterns from Uncertain Data Streams. IMCOM 2019: 917-936 - [c40]Fariha Moomtaheen Upoma, Salsabil Ahmed Khan, Chowdhury Farhan Ahmed, Tahira Alam, Sabit Anwar Zahin, Carson K. Leung
Discovering Correlation in Frequent Subgraphs. IMCOM 2019: 1045-1062 - [c39]Umama Dewan, Chowdhury Farhan Ahmed, Carson K. Leung, Redwan Ahmed Rizvee, Deyu Deng, Joglas Souza:
An efficient approach for mining weighted frequent patterns with dynamic weights. ICDM 2019: 13-27 - [c38]Redwan Ahmed Rizvee, Md Shahadat Hossain Shahin, Chowdhury Farhan Ahmed, Carson K. Leung, Deyu Deng, Jiaxing Jason Mai:
Sliding window based weighted periodic pattern mining over time series data. ICDM 2019: 118-132 - [c37]Nahian Ashraf, Riddho Ridwanul Haque, Md. Ashraful Islam, Chowdhury Farhan Ahmed, Carson K. Leung, Jiaxing Jason Mai, Bryan H. Wodi:
WeFreS: weighted frequent subgraph mining in a single large graph. ICDM 2019: 201-215 - 2018
- [j23]Sabit Anwar Zahin, Chowdhury Farhan Ahmed, Tahira Alam:
An effective method for classification with missing values. Appl. Intell. 48(10): 3209-3230 (2018) - [j22]Sayma Akther, Md. Rezaul Karim, Md. Samiullah, Chowdhury Farhan Ahmed:
Mining non-redundant closed flexible periodic patterns. Eng. Appl. Artif. Intell. 69: 1-23 (2018) - [j21]Md. Rezaul Karim, Michael Cochez
Mining maximal frequent patterns in transactional databases and dynamic data streams: A spark-based approach. Inf. Sci. 432: 278-300 (2018) - [c36]Md Shadman Rafid, Mohammad Mazedul Islam, Md. Naimul Hoque, Chowdhury Farhan Ahmed:
Reframing for Non-Linear Dataset Shift. EGC 2018: 131-142 - [c35]Md Mahmudur Rahman
Frequent Sequence Mining with Weight Constraints in Uncertain Databases. IMCOM 2018: 48:1-48:8 - [c34]Mohammad Fahim Arefin
Mining Sequential Correlation with a New Measure. ICDM 2018: 29-43 - [c33]Abeda Sultana, Hosneara Ahmed, Chowdhury Farhan Ahmed:
A New Approach for Mining Representative Patterns. ICDM 2018: 44-58 - [c32]Tahira Alam, Chowdhury Farhan Ahmed, Sabit Anwar Zahin, Muhammad Asif Hossain Khan, Maliha Tashfia Islam:
An Effective Ensemble Method for Multi-class Classification and Regression for Imbalanced Data. ICDM 2018: 59-74 - [c31]Rutba Aman, Chowdhury Farhan Ahmed:
Mining Cross-Level Closed Sequential Patterns. ICDM 2018: 199-214 - [c30]Sabrina Zaman Ishita, Faria Noor, Chowdhury Farhan Ahmed:
An Efficient Approach for Mining Weighted Sequential Patterns in Dynamic Databases. ICDM 2018: 215-229 - [c29]Md. Ashraful Islam
WFSM-MaxPWS: An Efficient Approach for Mining Weighted Frequent Subgraphs from Edge-Weighted Graph Databases. PAKDD (3) 2018: 664-676 - 2017
- [j20]Tahrima Hashem, Md. Rezaul Karim, Md. Samiullah, Chowdhury Farhan Ahmed:
An efficient dynamic superset bit-vector approach for mining frequent closed itemsets and their lattice structure. Expert Syst. Appl. 67: 252-271 (2017) - [j19]Ashis Kumar Chanda
A new framework for mining weighted periodic patterns in time series databases. Expert Syst. Appl. 79: 207-224 (2017) - [c28]Tahira Alam
An Efficient Approach for Mining Frequent Subgraphs. PReMI 2017: 486-492 - 2016
- [j18]José Hernández-Orallo, Adolfo Martínez Usó
Reframing in context: A systematic approach for model reuse in machine learning. AI Commun. 29(5): 551-566 (2016) - [j17]Akiz Uddin Ahmed, Chowdhury Farhan Ahmed, Md. Samiullah, Nahim Adnan, Carson Kai-Sang Leung
Mining interesting patterns from uncertain databases. Inf. Sci. 354: 60-85 (2016) - [c27]Md. Naimul Hoque, Chowdhury Farhan Ahmed, Nicolas Lachiche, Carson K. Leung
Reframing in Clustering. ICTAI 2016: 350-354 - [c26]Md. Badi-Uz-Zaman Shajib, Md. Samiullah, Chowdhury Farhan Ahmed, Carson K. Leung
An Efficient Approach for Mining Frequent Patterns over Uncertain Data Streams. ICTAI 2016: 980-984 - 2015
- [j16]Ashis Kumar Chanda
An efficient approach to mine flexible periodic patterns in time series databases. Eng. Appl. Artif. Intell. 44: 46-63 (2015) - [j15]Anna Fariha, Chowdhury Farhan Ahmed, Carson K. Leung
A new framework for mining frequent interaction patterns from meeting databases. Eng. Appl. Artif. Intell. 45: 103-118 (2015) - [j14]Chowdhury Farhan Ahmed, Nicolas Lachiche
Flexible propositionalization of continuous attributes in relational data mining. Expert Syst. Appl. 42(21): 7698-7709 (2015) - [c25]Amit Mandal, Mehedi Hasan, Anna Fariha, Chowdhury Farhan Ahmed:
GSCS - Graph Stream Classification with Side Information. APWeb 2015: 389-400 - [c24]Chowdhury Farhan Ahmed, Md. Samiullah, Nicolas Lachiche
Reframing in Frequent Pattern Mining. ICTAI 2015: 799-806 - [c23]Quazi Marufur Rahman, Anna Fariha, Amit Mandal, Chowdhury Farhan Ahmed, Carson K. Leung
A Sliding Window-Based Algorithm for Detecting Leaders from Social Network Action Streams. WI-IAT (1) 2015: 133-136 - 2014
- [j13]Md. Samiullah, Chowdhury Farhan Ahmed, Anna Fariha, Md. Rafiqul Islam
Mining frequent correlated graphs with a new measure. Expert Syst. Appl. 41(4): 1847-1863 (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) - [c22]Chowdhury Farhan Ahmed, Nicolas Lachiche
Reframing Continuous Input Attributes. ICTAI 2014: 31-38 - [c21]Chowdhury Farhan Ahmed, Clément Charnay, Nicolas Lachiche
Reframing on Relational Data. ILP 2014: 1-15 - 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) - [c20]Md. Samiullah, Chowdhury Farhan Ahmed, Manziba Akanda Nishi, Anna Fariha, S. M. Abdullah, Md. Rafiqul Islam
Correlation Mining in Graph Databases with a New Measure. APWeb 2013: 88-95 - [c19]Anna Fariha, Chowdhury Farhan Ahmed, Carson Kai-Sang Leung
Mining Frequent Patterns from Human Interactions in Meetings Using Directed Acyclic Graphs. PAKDD (1) 2013: 38-49 - 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
2000 – 2009
- 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 - 2005
- [c1]Md. Sumon Shahriar, A. R. Mustafa, Chowdhury Farhan Ahmed, Abu Ahmed Ferdaus, A. N. M. Zaheduzzaman, Shahed Anwar, Hafiz Md. Hasan Babu:
An Advanced Minimization Technique for Multiple Valued Multiple Output Logic Expressions Using LUT and Realization Using Current Mode CMOS. DSD 2005: 122-126
Coauthor Index
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-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: