Syed Khairuzzaman Tanbeer

According to our database1, Syed Khairuzzaman Tanbeer authored at least 47 papers between 2008 and 2018.

Collaborative distances :
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
An Innovative Framework for Supporting Frequent Pattern Mining Problems in IoT Environments.
Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

2017
Scalable regular pattern mining in evolving body sensor data.
Future Generation Comp. Syst., 2017

2016
Interactive mining of diverse social entities.
KES Journal, 2016

2015
Mining Popular Patterns: A Novel Mining Problem and Its Application to Static Transactional Databases and Dynamic Data Streams.
Trans. Large-Scale Data- and Knowledge-Centered Systems, 2015

Mining Regularities in Body Sensor Network Data.
Proceedings of the Internet and Distributed Computing Systems, 2015

2014
Interactive discovery of influential friends from social networks.
Social Netw. Analys. Mining, 2014

Interactive Mining of Strong Friends from Social Networks and its Applications in E-Commerce.
J. Org. Computing and E. Commerce, 2014

A Scalable Data Analytics Algorithm for Mining Frequent Patterns from Uncertain Data.
Proceedings of the Trends and Applications in Knowledge Discovery and Data Mining, 2014

Tightening Upper Bounds to the Expected Support for Uncertain Frequent Pattern Mining.
Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

A Tree-based Algorithm for Mining Diverse Social Entities.
Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

Mining of Diverse Social Entities from Linked Data.
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

2013
PUF-Tree: A Compact Tree Structure for Frequent Pattern Mining of Uncertain Data.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2013

Finding groups of friends who are significant across multiple domains in social networks.
Proceedings of the Fifth International Conference on Computational Aspects of Social Networks, 2013

Finding Diverse Friends in Social Networks.
Proceedings of the Web Technologies and Applications - 15th Asia-Pacific Web Conference, 2013

2012
Single-pass incremental and interactive mining for weighted frequent patterns.
Expert Syst. Appl., 2012

Interactive mining of high utility patterns over data streams.
Expert Syst. Appl., 2012

Mining probabilistic datasets vertically.
Proceedings of the 16th International Database Engineering & Applications Symposium, 2012

Mining Popular Patterns from Transactional Databases.
Proceedings of the Data Warehousing and Knowledge Discovery, 2012

Mining Social Networks for Significant Friend Groups.
Proceedings of the Database Systems for Advanced Applications, 2012

Fast Tree-Based Mining of Frequent Itemsets from Uncertain Data.
Proceedings of the Database Systems for Advanced Applications, 2012

Finding Popular Friends in Social Networks.
Proceedings of the 2012 Second International Conference on Cloud and Green Computing, 2012

DIFSoN: Discovering influential friends from social networks.
Proceedings of the Fourth International Conference on Computational Aspects of Social Networks, 2012

2011
A framework for mining interesting high utility patterns with a strong frequency affinity.
Inf. Sci., 2011

HUC-Prune: an efficient candidate pruning technique to mine high utility patterns.
Appl. Intell., 2011

Finding Strong Groups of Friends among Friends in Social Networks.
Proceedings of the IEEE Ninth International Conference on Dependable, 2011

2010
Mining High Utility Web Access Sequences in Dynamic Web Log Data.
Proceedings of the 11th ACIS International Conference on Software Engineering, 2010

Mining Regular Patterns in Data Streams.
Proceedings of the Database Systems for Advanced Applications, 2010

Mining Regular Patterns in Incremental Transactional Databases.
Proceedings of the Advances in Web Technologies and Applications, 2010

An Efficient Method for Incremental Mining of Share-Frequent Patterns.
Proceedings of the Advances in Web Technologies and Applications, 2010

2009
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases.
IEEE Trans. Knowl. Data Eng., 2009

Sliding window-based frequent pattern mining over data streams.
Inf. Sci., 2009

Efficient single-pass frequent pattern mining using a prefix-tree.
Inf. Sci., 2009

An Efficient Algorithm for Sliding Window-Based Weighted Frequent Pattern Mining over Data Streams.
IEICE Transactions, 2009

Discovering Periodic-Frequent Patterns in Transactional Databases.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2009

An Efficient Candidate Pruning Technique for High Utility Pattern Mining.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2009

Mining high utility patterns in incremental databases.
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, 2009

Parallel and Distributed Frequent Pattern Mining in Large Databases.
Proceedings of the 11th IEEE International Conference on High Performance Computing and Communications, 2009

Efficient Mining of Weighted Frequent Patterns over Data Streams.
Proceedings of the 11th IEEE International Conference on High Performance Computing and Communications, 2009

2008
Mining Regular Patterns in Transactional Databases.
IEICE Transactions, 2008

Handling Dynamic Weights in Weighted Frequent Pattern Mining.
IEICE Transactions, 2008

Mining Weighted Frequent Patterns in Incremental Databases.
Proceedings of the PRICAI 2008: Trends in Artificial Intelligence, 2008

CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

RP-Tree: A Tree Structure to Discover Regular Patterns in Transactional Database.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2008

Mining Weighted Frequent Patterns Using Adaptive Weights.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2008

Efficient frequent pattern mining over data streams.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns.
Proceedings of the Data Mining and Analytics 2008, 2008

Efficient Single-Pass Mining of Weighted Interesting Patterns.
Proceedings of the AI 2008: Advances in Artificial Intelligence, 2008


  Loading...