News (2014)
News (2014)
Osmar Zaiane's Visit
On Thursday, December 04, 2014, Dr. Osmar R. Zaïane, who is a McCalla and Killam Professor in Department of Computing Science at University of Alberta and a Scientific Director of Alberta Innovates Centre for Machine Learning (AICML), gave a keynote presentation on "The potential and pitfalls of Big data".
IEEE SocialCom 2014
Dr. Carson K. Leung serves as a Program Vice-Chair for the Seventh IEEE International Conference on Social Computing and Networking (SocialCom 2014), which is collocated with the Fourth IEEE International Conference on Big Data and Cloud Computing (BDCloud 2014), held on December 03-05, 2014 in Sydney, NSW, Australia.
IEEE SocialCom - GSN 2014
Dr. Carson K. Leung serves as a General Chair for the Third International Workshop on Graph Databases and Social Networking (GSN 2014), which is organized in conjunction with the Seventh IEEE International Conference on Social Computing and Networking (SocialCom 2014), held on December 03-05, 2014 in Sydney, NSW, Australia. The proceedings are published by the IEEE Computer Society.
Wookey Lee, Carson K.S. Leung, James Geller, Jinho Kim:
GSN 2014 (Third International Workshop on Graph Databases and Social Networking):
In Jinjun Chen, Laurence T. Yang (Eds.):
IEEE SocialCom Workshops 2014:
xxxiv
Message from GSN Chairs
GSN 2014
Welcome to the Third International Workshop on Graph Databases and Social Networking (GSN 2014). This workshop is co-located with the 7th IEEE International Conference on Social Computing and Networking (SocialCom 2014) held on 3-5 December 2014, Sydney, Australia.
Recently, there are many researches in the field of social network services and the size of data in internet is increasing rapidly. The purpose of this workshop is to share to researchers an opportunity to introduce recent issues related to graph databases and social networking. Through this workshop, GSN 2014, researchers and practitioners can exchange current issues, challenges, new technologies, and practical experiences.
GSN2014 contains 5 papers. Each of them was peer reviewed by at least three program committee members. The workshop covers a broad range of topics in the field of graph databases and social networking such as social network services; large data processing in SNS; data mining/knowledge discovery in SNS; databases for SNS data; multimedia applications; multimedia database applications; semantic Web services; emotional data processing; performance enhancement techniques in large data; information retrieval, filtering, and dissemination; stream data management; Web access to databases; social data management; data analytics; privacy control; mobile applications. We thank the authors for submitting their work and the members of the GSN2014 program committee for managing the reviews of the symposium papers in such short time.
We would like to express our gratitude to everyone who participates in this workshop. We hope you enjoy the workshop and have a great time in Sydney, Australia.
Wookey Lee, Inha University, Korea
Carson K.S. Leung, University of Manitoba, Canada
GSN 2014 General Co-chairs
James Geller, New Jersey Institute of Technology, USA
Jinho Kim, Kangwon National University, Korea
GSN 2014 Program Co-chairs
Department Seminar - Fall 2014
On Tuesday, December 02, 2014, Adam G.M. Pazdor gave a presentation on his (Honours) project on "Frequent pattern mining in social networks using bit-strings". His fellow lab member, Irish J.M. Medina, also gave her presentation in the seminar.
Dan Morgan's Visit
On Thursday, October 23, 2014, Mr. Danial A. Morgan (an Oracle ACE Director) gave a UofM CS seminar on "Challenges in a world of large databases and business intelligence". The seminar was hosted by Dr. Carson K. Leung.
Kyoji Kawagoe's Visit
Dr. Kyoji Kawagoe (a Full Professor in College of Information Science and Engineering at Ristumeikan University and the Vice-Director of Ritsumeikan University Library, Japan), who is also the Chair of ACM SIGMOD Japan Chapter, visited our lab during August-October. On Tuesday, October 21, 2014, he presented his research work on "Time series approximation for temporal data management" in a UofM CS seminar. The seminar was hosted by Dr. Carson K. Leung.
KES 2014 & KES J 20(2) (2016)
Our refereed KES 2014 paper titled "A tree-based algorithm for mining diverse social entities" was selected to be expanded and enhanced for inclusion in a special issue of the International Journal of Knowledge Based and Intelligent Engineering Systems (KES Journal). The resulting journal article was published in KES Journal 20(2) by IOS Press in May 2016.
KES 2014
Peter Braun presented two refereed papers in KES 2014 held in Gdynia, Poland:
On Monday, September 15, 2014, he presented the refereed paper titled "Effectively and efficiently mining frequent patterns.from dense graph streams on disk", which he co-authored with his academic supervisor (Dr. Carson K. Leung), his fellow lab members (Juan J. Cameron and Fan Jiang) and their international collaborator (Dr. Alfredo Cuzzocrea from Italian National Research Council).
On Tuesday, September 16, 2014, he presented the refereed paper titled "A tree-based algorithm for mining diverse social entities", which he co-authored with his academic supervisor (Dr. Carson K. Leung), his fellow lab members (Richard Kyle MacKinnon and Dr. Syed K. Tanbeer) and their international collaborator (Dr. Alfredo Cuzzocrea from Italian National Research Council).
Both papers were published by Elsevier.
DaWaK 2014 & CPE 28(15) (2016)
Our refereed DaWaK 2014 paper titled "Mining interesting 'following' patterns from social networks" was selected to be revised and extended for inclusion in a special issue of the Journal of Concurrency and Computation: Practice and Experience. The resulting journal article was published in CPE 28(15) by Wiley in October 2016.
Ladjel Bellatreche, Mukesh Mohania:
Concurrency and Computation: Practice & Experience (CPE) 28(15),
special issue on DaWaK 2014:
3945-3947 (October 2016)
The DaWaK 2014 call for papers attracted 109 papers, and the program committee finally selected 34 full papers and 8 short papers, making an acceptance rate of 31%.
Out of the 34 full papers, we selected seven papers to be invited for the special issue in the Journal Concurrency and Computation: Practice and Experience, Wiley. After a second round of reviews, we finally accepted four papers. Thus, the relative acceptance rate for the papers included in this special issue is competitive.
We congratulate the authors of these four papers and thank all authors who submitted articles to DaWaK 2014. It should be noticed that three of these papers used case studies issued from international projects funded either by European Commission or Natural Sciences and Engineering Research Council of Canada and University of Manitoba.
The third paper titled, Parallel social network mining for interesting following patterns, by Carson Leung, Fan Jiang, Adam Pazdor, and Aaron Peddle [3], proposes a data structure called FoP-structure to capture the directional following actions among social entities. Two data mining algorithms are also presented. The first algorithm, called FoP-miner, makes use of the proposed data structure to serially compute interesting following patterns. The second algorithm, called ParFoP-miner, speeds up the data mining process by concurrently computing interesting following patterns in parallel. Analytical and experimental evaluation that demonstrates the efficiency of the proposed data structure and mining algorithms in terms of space consumption and runtime are conducted. FoP-miner and ParFoP-miner are compared against the most important existing algorithms FP-growth, TD-FP-Growth, H-mine, VIPER, etc. using IBM synthetic datasets and real-life retail datasets. This project is partially supported by Natural Sciences and Engineering Research Council of Canada and University of Manitoba.
REFERENCES
3. Leung C, Jiang F, Pazdor AGM, Peddle AM. Parallel social network mining for interesting following patterns. Concurrency and Computation: Practice and Experience 2016; 28(15):3994-4012.
LADJEL BELLATRECHE
LIAS/ISAE-ENSMA, Poitiers University, Futuroscope,
Poitiers, France
E-mail: bellatreche@ensma.fr
MUKESH MOHANIA
IBM Research, Carlton, Australia
Jiang's Teaching
Fan Terry Jiang, a PhD candidate in our lab, teaches distance & online education-based COMP 1010 (D01) (Introductory Computer Science 1) in Fall 2014 from September 04 to December 03, 2014.
IEEE Certificate of Appreciation
This certificate is awarded for service to any Society activity or program, such as a conference organizing or program committee. Awards can be given to subcommittee members in lieu of a letter of appreciation.
2014 Certificate of Appreciation Recipients – 3rd Quarter – JULY – SEPT
Carson Leung
IEEE/ACM ASONAM 2014
Dr. Carson K. Leung serves as a Tutorial Chair for the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014) held on August 12-16, 2014 in Beijing (北京), China.
Jon Rokne, Yan Jia:
IEEE/ACM ASONAM 2014:
xiii
The success of ASONAM 2014 depends mainly on the people and organizations that support the conference. We thank all of the volunteers who helped organize this conference. In particular, we thank the Program Chairs, Xindong Wu, Martin Ester and Guandong Xu who together with the Program Committee, created a great technical program.
In addition, we thank Industry Track Co-Chairs: Xueqi Cheng, Daniel Zeng and Jie Gao; Local Arrangements Chairs: Yuxiao Li, Lei LiHefei,Tiejian Luo,Bin Zhou; Workshops Chairs: Wolfgan Nejd, Jie Tang, Bettina Berendt; Tutorial Chairs: V. S. Subrahmanian, Meng Wang, Carson Leung; Panels Chairs: Alvin Chin, Jing Xu, Hiroyuki Kitagawa; Demos Chairs: Tansel Ozyer, Wei Wang; Registration Chair: Qingshun Meng; Finance Chairs: Reda Alhajj, Lu Xu; Publication Chairs: Xiaohui (Daniel) Tao, Min-Yuh Day; Web Chair: Zhiang Wu.
Jon Rokne, University of Calgary, Calgary, Alberta, Canada,
Yan Jia, University of Defence Technology, Beijing, China
ASONAM 2014 General Chairs
IEEE Big Data Congress 2014
On Tuesday, July 01, 2014, Richard Kyle MacKinnon presented a refereed paper titled "Reducing the search space for Big data mining for interesting patterns from uncertain data", which he co-authored with his academic supervisor (Dr. Carson K. Leung) and his fellow lab member (Fan Jiang), in IEEE Big Data Congress 2014 held in Anchorage, AK, USA.
FGCS 37 (2014)
Alfredo Cuzzocrea:
Innovative methods and algorithms for advanced data-intensive computing.
Future Generation Computer Systems (FGCS) 37:
60-63 (July 2014)
The special issue contains twelve papers, which have gone through several rigorous review rounds before being accepted for final inclusion. Some of the contributions have been invited for submission as the best papers of the 11th LNCS International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2011), held in Melbourne, Australia, during October 24–26, 2011, leaded by the Editor.
The sixth paper, titled "Mining Constrained Frequent Itemsets from Distributed Uncertain Data" [2], by Alfredo Cuzzocrea, Carson Kai-Sang Leung and Richard Kyle MacKinnon, considers the application scenario represented by large amounts of streaming data generated from various sources, such as sensor data from environmental surveillance networks. In this context, a relevant problem is represented by the issue of supporting distributed frequent itemset mining, which is, indeed, relevant for a plethora of applications. Despite this, many existing distributed frequent itemset mining algorithms do not allow users to express the itemsets to be mined according to their intention via the use of constraints. As a consequence, these unconstrained mining algorithms can yield numerous itemsets that are not interesting to users. Moreover, due to inherited measurement inaccuracies and/or network latencies, the data are often riddled with uncertainty. At the convergence of both challenges (i.e., constraints, and uncertainty), a strident call for both constrained mining and uncertain data mining arises, with also relevant use cases (e.g., wireless sensor networks of uncertain data). In order to tackle this main challenge, authors propose a tree-based system for mining frequent itemsets that satisfy user-defined constraints from distributed environments with uncertainty. The analytical contribution is complemented by means of a comprehensive experimental evaluation and analysis whose results clearly support authors’ claims.
[2]
A. Cuzzocrea, C.K.-S. Leung, R.K. MacKinnon
Mining constrained frequent itemsets from distributed uncertain data
Future Gener. Comput. Syst., 37 (2014), pp. 117–126
IEEE AINA 2014
Dr. Carson K. Leung serves as an International Liaison Chair for the 28th IEEE International Conference on Advanced Information Networking and Applications (AINA-2014) held on May 13-16, 2014 in Victoria, BC, Canada.
On Wednesday, May 14, 2014, Fan Jiang presented a refereed paper titled "Distributed uncertain data mining for frequent patterns satisfying anti-monotonic constraints", which he co-authored with his academic supervisor (Dr. Carson K. Leung) and his fellow lab member (Richard Kyle MacKinnon), in IEEE AINA 2014 held in Victoria, BC, Canada.
PAKDD - SocNet 2014
Dr. Carson K. Leung serves as a Program Chair for the 2014 International Workshop on Data Mining in Social Networks (SocNet), which is organized in conjunction with the 18th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2014), held on May 13, 2014 in Tainan (台南), Taiwan. The proceedings are published by the Springer.
JOCEC 24(2-3) (2014)
Jinjun Chen, Jianxun Liu:
Introduction: social computing and social networks.
Journal of Organizational Computing and Electronic Commerce (JOCEC) 24(2-3),
special issue on social computing and social networks:
119-121 (2014)
Tanbeer and co-authors integrate data mining with social computing to help the individual distinguish strong friends from among a large number of friends in a specific portion of the social networks in which he or she is interested. The new social network mining algorithms also allow the individual to interactively change his or her mining parameters.
NSERC CSG-M 2014
Congratulation to Richard Kyle MacKinnon, who won an NSERC Canada Graduate Scholarship-Master’s (CGS M) with a value of $17,500 for 12 months. He also received a University of Manitoba Tri-council Top-Up Award with an additional $5,000. He was one of the only two winners in Department of Computer Science.
UMGF 2014
Congratulation to Richard Kyle MacKinnon, who won a University of Manitoba Graduate Fellowship (UMGF). Among all Master's and PhD students, he was one of the only two new UMGF recipients in Department of Computer Science.
USRA 2014
Three lab members won undergraduate student research awards:
Third-year undergraduate student Mr. Aaron M. Peddle, who is enrolled in the B.C.Sc.(Hons.) degree co-op program, won a UofM Vice-President (Research and International) Undergraduate Research Award (URA) to conduct a full-time 16-week research project in the area of data mining (social network mining) under the academic supervision of Dr. Carson K. Leung. Among ~25,000 undergraduate students across the campus, he was one of 83 winners of this award. He was the only winner in Department of Computer Science.
Third-year undergraduate student Ms. Vanessa J. Reimer, who is also enrolled in the B.C.Sc.(Hons.) degree co-op program, won an NSERC Undergraduate Student Research Award (USRA) to conduct a full-time 16-week research project on "Mining interesting information from social networks" in the area of data mining under the academic supervision of Dr. Carson K. Leung. She was one of the two winners in Department of Computer Science.
Third-year undergraduate student Mr. Dacheng Liu (刘炟呈), from Wuhan University (武汉大学), won a MITACS Globalink award to conduct a full-time 12-week research project on "Mining interesting information from social networks" in the area of data mining (social network mining) under the academic supervision of Dr. Carson K. Leung. He was one of the 12 Globalink Research Interns in the entire UofM campus, and one of the two in UofM Department of Computer Science.
Innovate Manitoba: Matchmaking and Funding Day 2014
Innovate Manitoba: News
Innovate Manitoba's Matchmaking and Funding Day Connects Researchers, Industry and Funding Opportunities
The innovation framework for business success received another boost at Innovate Manitoba’s second annual Matchmaking and Funding Day. The event held April 23 at Red River College (RRC) brought together world-class academic researchers, industry and federal granting agencies.
Linking Business Problems with Research Solutions
Dr. Carson Leung, Professor, U of M Department of Computer Science, got more than he expected from the event. "I recognized the networking opportunities immediately and was able to talk to an industry partner who might benefit from work I'm doing in the area of computer science."
Matchmaking and Funding Day is the third and final step in the IndustryCONNECTS program. Parts one and two focused on academic researcher pitch coaching, practice and constructive industry feedback.
Wookey Lee's Visit
Dr. Wookey Lee (a Full Professor and the Director of University-Industry Cooperation at Inha University, South Korea), who is also an Executive Committee member of IEEE TCDE and an Associate Editor of World Wide Web Journal: Internet and Web Information Systems (WWWJ), visited our lab in April. On Friday, April 04, 2014, he presented his research work on "what trees are for on the complex networks?". The presentation was hosted by Dr. Carson K. Leung.
EBAO (2014)
Category: Big data analysis
John Wang:
In Encyclopedia of Business Analytics and Optimization:
vii-xxviii (February 2014)
ISBN 978-1-4666-5202-6
Leung - who has published more than 90 papers on the topics of databases, data mining, social network analysis, visual analytics, as well as Big Data analytics (including papers in ACM TODS, IEEE ICDE, and IEEE ICDM, as well as the SCA 2012 Best Paper on social computing and its applications) - presents an article on the up-to-date definitions of important issues in Big Data mining and analytics, which aims to analyze high volumes of valuable, high-velocity and high-variety data for business analytics and optimization in various real-life applications. The article provides the latest comprehensive coverage on key concepts for mining frequent patterns (e.g., frequently collocated business events, popular bundles of merchandise items) from Big Data with the MapReduce programming model; it also discusses future trends and technologies of Big Data mining and analytics in social network analysis and visual analytics.
MITACS Globalink 2014
Twitter: UofManitoba Comp Sci (@uofmcs) 12:43 PM - 10 Feb 2014
Congratulations to Drs Leung and Hemmati on obtaining 2 of the 12 @DiscoverMitacs Globalinks research internships awarded @umanitoba!
COMP 4380 - Database implementation
Glad to hear that from Serena Vandersteen, a former student who took my course on database implementation (COMP 4380).
On January 10, 2014, Serena Vandersteen posted on her Facebook:
"Glad to say that I'm actually referring back to my notes on the different types of DB table joins. Been a while but it's like riding a bike. COMP 4380 'Database Implementation' sure was useful!! This is totally validating why I spent time studying what I studied in University. Feels good!!"
"Best start to the morning ever = seeing SQL code and having the a-ha moment where 'Wow...I know where this is in my notes....*looks up notes on Dropbox* ta da'. DB courses were some of my favourite courses! This makes me miss school though."
On January 11, 2014, Lai Wan Wong commented on the post:
"Definitely, Leung's notes is precise and condense. A must-to-have quick reference."
IJDS
Dr. Carson K. Leung serves as an Editorial Board Member for the International Journal of Data Science (IJDS).