default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMafruz Zaman Ashrafi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[c13]Yuan Fang
, Mafruz Zaman Ashrafi, See-Kiong Ng:
Privacy beyond Single Sensitive Attribute. DEXA (1) 2011: 187-201
2000 – 2009
- 2009
- [j5]Mafruz Zaman Ashrafi, See-Kiong Ng:
Privacy-preserving e-payments using one-time payment details. Comput. Stand. Interfaces 31(2): 321-328 (2009) - [c12]Mafruz Zaman Ashrafi, See-Kiong Ng:
Efficient and Anonymous Online Data Collection. DASFAA 2009: 471-485 - [c11]Mafruz Zaman Ashrafi, See-Kiong Ng:
Collusion-resistant anonymous data collection method. KDD 2009: 69-78 - [r1]Mafruz Zaman Ashrafi:
Distributed Association Rule Mining. Encyclopedia of Data Warehousing and Mining 2009: 695-700 - 2008
- [c10]Mafruz Zaman Ashrafi, See-Kiong Ng:
Enabling Privacy-Preserving e-Payment Processing. DASFAA 2008: 596-603 - 2007
- [j4]Longbing Cao, Chengqi Zhang, Qiang Yang, David A. Bell, Michail Vlachos, Bahar Taneri, Eamonn J. Keogh, Philip S. Yu, Ning Zhong, Mafruz Zaman Ashrafi, David Taniar, Eugene Dubossarsky, Warwick Graco:
Domain-Driven, Actionable Knowledge Discovery. IEEE Intell. Syst. 22(4): 78-88 (2007) - [j3]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
Redundant association rules reduction techniques. Int. J. Bus. Intell. Data Min. 2(1): 29-63 (2007) - 2005
- [j2]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
PPDAM: Privacy-Preserving Distributed Association-Rule-Mining Algorithm. Int. J. Intell. Inf. Technol. 1(1): 49-69 (2005) - [c9]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
Redundant Association Rules Reduction Techniques. Australian Conference on Artificial Intelligence 2005: 254-263 - [c8]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
An Efficient Compression Technique for Frequent Itemset Generation in Association Rule Mining. PAKDD 2005: 125-135 - 2004
- [j1]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
ODAM: An Optimized Distributed Association Rule Mining Algorithm. IEEE Distributed Syst. Online 5(3) (2004) - [c7]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
Reducing Communication Cost in a Privacy Preserving Distributed Association Rule Mining. DASFAA 2004: 381-392 - [c6]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
A New Approach of Eliminating Redundant Association Rules. DEXA 2004: 465-474 - 2003
- [c5]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
A Compress-Based Association Mining Algorithm for Large Dataset. International Conference on Computational Science 2003: 978-987 - [c4]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
Towards Privacy Preserving Distributed Association Rule Mining. IWDC 2003: 279-289 - 2002
- [c3]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
A Data Mining Architecture for Distributed Environments. IICS 2002: 27-38 - [c2]Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith:
A Data Mining Architecture for Clustered Environments. PARA 2002: 89-98 - [c1]Nung Kion Lee, David Taniar, J. Wenny Rahayu, Mafruz Zaman Ashrafi:
Implementation of Parallel Collection Equi-Join Using MPI. PARA 2002: 217-226
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 13:04 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:
