default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSyed Khairuzzaman Tanbeer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c33]Peter Braun, Alfredo Cuzzocrea, Carson K. Leung
, Adam G. M. Pazdor, Joglas Souza, Syed Khairuzzaman Tanbeer:
Pattern Mining from big IoT Data with fog Computing: Models, Issues, and Research Perspectives. CCGRID 2019: 584-591- 2018
- [c32]Peter Braun, Alfredo Cuzzocrea, Carson K. Leung, Adam G. M. Pazdor, Syed Khairuzzaman Tanbeer, Giorgio Mario Grasso:
An Innovative Framework for Supporting Frequent Pattern Mining Problems in IoT Environments. ICCSA (5) 2018: 642-657 - 2017
- [j15]Syed Khairuzzaman Tanbeer, Mohammad Mehedi Hassan, Ahmad Almogren, Mansour Zuair, Byeong-Soo Jeong:
Scalable regular pattern mining in evolving body sensor data. Future Gener. Comput. Syst. 75: 172-186 (2017) - 2016
- [j14]Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer, Alfredo Cuzzocrea, Peter Braun, Richard Kyle MacKinnon:
Interactive mining of diverse social entities. Int. J. Knowl. Based Intell. Eng. Syst. 20(2): 97-111 (2016) - 2015
- [j13]Alfredo Cuzzocrea, Fan Jiang, Carson Kai-Sang Leung, Dacheng Liu, Aaron M. Peddle, Syed Khairuzzaman Tanbeer:
Mining Popular Patterns: A Novel Mining Problem and Its Application to Static Transactional Databases and Dynamic Data Streams. Trans. Large Scale Data Knowl. Centered Syst. 21: 115-139 (2015) - [c31]Syed Khairuzzaman Tanbeer, Mohammad Mehedi Hassan, Majed A. AlRubaian, Byeong-Soo Jeong:
Mining Regularities in Body Sensor Network Data. IDCS 2015: 88-99 - 2014
- [j12]Syed Khairuzzaman Tanbeer, Carson Kai-Sang Leung, Juan J. Cameron:
Interactive Mining of Strong Friends from Social Networks and its Applications in E-Commerce. J. Organ. Comput. Electron. Commer. 24(2-3): 157-173 (2014) - [j11]Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer, Juan J. Cameron:
Interactive discovery of influential friends from social networks. Soc. Netw. Anal. Min. 4(1): 154 (2014) - [c30]Alfredo Cuzzocrea, Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer:
Mining of Diverse Social Entities from Linked Data. EDBT/ICDT Workshops 2014: 269-274 - [c29]Peter Braun, Alfredo Cuzzocrea, Carson Kai-Sang Leung, Richard Kyle MacKinnon, Syed Khairuzzaman Tanbeer:
A Tree-based Algorithm for Mining Diverse Social Entities. KES 2014: 223-232 - [c28]Carson Kai-Sang Leung, Richard Kyle MacKinnon, Syed Khairuzzaman Tanbeer:
Tightening Upper Bounds to the Expected Support for Uncertain Frequent Pattern Mining. KES 2014: 328-337 - [c27]Richard Kyle MacKinnon, Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer:
A Scalable Data Analytics Algorithm for Mining Frequent Patterns from Uncertain Data. PAKDD Workshops 2014: 404-416 - 2013
- [c26]Syed Khairuzzaman Tanbeer, Carson Kai-Sang Leung:
Finding Diverse Friends in Social Networks. APWeb 2013: 301-309 - [c25]Syed Khairuzzaman Tanbeer, Fan Jiang, Carson Kai-Sang Leung, Richard Kyle MacKinnon, Irish J. M. Medina:
Finding groups of friends who are significant across multiple domains in social networks. CASoN 2013: 21-26 - [c24]Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer:
PUF-Tree: A Compact Tree Structure for Frequent Pattern Mining of Uncertain Data. PAKDD (1) 2013: 13-25 - 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) - [c23]Syed Khairuzzaman Tanbeer, Carson Kai-Sang Leung, Juan J. Cameron:
DIFSoN: Discovering influential friends from social networks. CASoN 2012: 120-125 - [c22]Fan Jiang, Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer:
Finding Popular Friends in Social Networks. CGC 2012: 501-508 - [c21]Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer:
Mining Social Networks for Significant Friend Groups. DASFAA Workshops 2012: 180-192 - [c20]Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer:
Fast Tree-Based Mining of Frequent Itemsets from Uncertain Data. DASFAA (1) 2012: 272-287 - [c19]Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer:
Mining Popular Patterns from Transactional Databases. DaWaK 2012: 291-302 - [c18]Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer, Bhavek P. Budhia, Lauren C. Zacharias:
Mining probabilistic datasets vertically. IDEAS 2012: 199-204 - 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) - [c17]Juan J. Cameron, Carson Kai-Sang Leung, Syed Khairuzzaman Tanbeer:
Finding Strong Groups of Friends among Friends in Social Networks. DASC 2011: 824-831 - 2010
- [c16]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong:
An Efficient Method for Incremental Mining of Share-Frequent Patterns. APWeb 2010: 147-153 - [c15]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong:
Mining Regular Patterns in Incremental Transactional Databases. APWeb 2010: 375-377 - [c14]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong:
Mining Regular Patterns in Data Streams. DASFAA (1) 2010: 399-413 - [c13]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) - [c12]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong:
Efficient Mining of Weighted Frequent Patterns over Data Streams. HPCC 2009: 400-406 - [c11]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong:
Parallel and Distributed Frequent Pattern Mining in Large Databases. HPCC 2009: 407-414 - [c10]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Mining high utility patterns in incremental databases. ICUIMC 2009: 656-663 - [c9]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Discovering Periodic-Frequent Patterns in Transactional Databases. PAKDD 2009: 242-253 - [c8]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) - [c7]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 - [c6]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 - [c5]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Efficient frequent pattern mining over data streams. CIKM 2008: 1447-1448 - [c4]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 - [c3]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Mining Weighted Frequent Patterns Using Adaptive Weights. IDEAL 2008: 258-265 - [c2]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 - [c1]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Mining Weighted Frequent Patterns in Incremental Databases. PRICAI 2008: 933-938
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 2025-01-09 12:57 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:
