default search action
Richard Kyle MacKinnon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j3]Carson Kai-Sang Leung, Richard Kyle MacKinnon, Fan Jiang:
Finding efficiencies in frequent pattern mining from big uncertain data. World Wide Web 20(3): 571-594 (2017) - 2016
- [j2]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
- [c14]Carson Kai-Sang Leung, Richard Kyle MacKinnon:
Balancing Tree Size and Accuracy in Fast Mining of Uncertain Frequent Patterns. DaWaK 2015: 57-69 - [c13]Alfredo Cuzzocrea, Carson K. Leung, Richard Kyle MacKinnon:
Approximation to Expected Support of Frequent Itemsets in Mining Probabilistic Sets of Uncertain Data. KES 2015: 613-622 - [c12]Richard Kyle MacKinnon, Carson K. Leung:
Stock Price Prediction in Undirected Graphs Using a Structural Support Vector Machine. WI-IAT (1) 2015: 548-555 - 2014
- [j1]Alfredo Cuzzocrea, Carson Kai-Sang Leung, Richard Kyle MacKinnon:
Mining constrained frequent itemsets from distributed uncertain data. Future Gener. Comput. Syst. 37: 117-126 (2014) - [c11]Carson Kai-Sang Leung, Richard Kyle MacKinnon, Fan Jiang:
Distributed Uncertain Data Mining for Frequent Patterns Satisfying Anti-monotonic Constraints. AINA Workshops 2014: 1-6 - [c10]Carson Kai-Sang Leung, Richard Kyle MacKinnon, Fan Jiang:
Reducing the Search Space for Big Data Mining for Interesting Patterns from Uncertain Data. BigData Congress 2014: 315-322 - [c9]Carson Kai-Sang Leung, Richard Kyle MacKinnon:
BLIMP: A Compact Tree Structure for Uncertain Frequent Pattern Mining. DaWaK 2014: 115-123 - [c8]Carson Kai-Sang Leung, Richard Kyle MacKinnon:
Fast Algorithms for Frequent Itemset Mining from Uncertain Data. ICDM 2014: 893-898 - [c7]Richard Kyle MacKinnon, Teagan D. Strauss, Carson Kai-Sang Leung:
DISC: Efficient Uncertain Frequent Pattern Mining with Tightened Upper Bounds. ICDM Workshops 2014: 1038-1045 - [c6]Carson Kai-Sang Leung, Richard Kyle MacKinnon, Yang Wang:
A machine learning approach for stock price prediction. IDEAS 2014: 274-277 - [c5]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 - [c4]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 - [c3]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 - [c2]Fan Jiang, Carson Kai-Sang Leung, Richard Kyle MacKinnon:
BigSAM: Mining Interesting Patterns from Probabilistic Databases of Uncertain Big Data. PAKDD Workshops 2014: 780-792 - 2013
- [c1]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
Coauthor Index
aka: Carson Kai-Sang Leung
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-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint