This is a forum for anyone interested in Artificial Intelligence and Data Mining!https://forum.philippe-fournier-viger.com/index.phpThu, 30 Apr 2026 09:26:04 -0400 Phorum 5.2.10 https://forum.philippe-fournier-viger.com/read.php?5,6881,6881#msg-6881 https://forum.philippe-fournier-viger.com/read.php?5,6881,6881#msg-6881
I am announcing today that the Data Mining Forum will move to a new address:

https://forum2.philippe-fournier-viger.com

This is because the original forum was built more than 12 years ago based on Phorum, an old PhP script that is no longer supported since about 10 years. The website is thus becoming harder and harder to maintain as it is incompatible with new PhP versions. I will keep the old forum online so that it can be used to read the old messages but will deactivate the posting of new messages.

Please use the new forum for any new discussions.

If you have any suggestions, also please post in the new forum.

Thanks for your understanding,

Philippe]]> webmasterphilfv The Data Mining / Big Data ForumTue, 05 Apr 2022 00:59:08 -0400 https://forum.philippe-fournier-viger.com/read.php?5,6839,6839#msg-6839 https://forum.philippe-fournier-viger.com/read.php?5,6839,6839#msg-6839
I hope you are doing well.

Please let us know the appropriate data mining conferences open for submission.

Regards,]]> User The Data Mining / Big Data ForumSun, 03 Apr 2022 12:19:37 -0400 https://forum.philippe-fournier-viger.com/read.php?5,6836,6836#msg-6836 https://forum.philippe-fournier-viger.com/read.php?5,6836,6836#msg-6836
I wonder if there's a means to enter real-valued utilities in an SPMF file. My utilities are prices, that is, with two decimal places. I'm multipliying them all by 100 to transform them into integer numbers.

I've taken a look at a thread in which someone posted a version of FHM that works with float numbers, but I'm not sure if there's a general solution to the problem.

Thanks in advance.]]> Pepe Lopis The Data Mining / Big Data ForumTue, 29 Mar 2022 12:19:59 -0400 https://forum.philippe-fournier-viger.com/read.php?5,6830,6830#msg-6830 https://forum.philippe-fournier-viger.com/read.php?5,6830,6830#msg-6830ca.pfv.spmf.algorithms.clustering.dbscan.DoubleArrayDBS
public class MyDoubleArrayDBS extends DoubleArrayDBS implements KryoSerializable {

boolean visited = false;
public MyDoubleArrayDBS(double[] data) {
super(data);
}.

it has one params]]> hbat The Data Mining / Big Data ForumThu, 17 Mar 2022 11:24:21 -0400 https://forum.philippe-fournier-viger.com/read.php?5,6827,6827#msg-6827 https://forum.philippe-fournier-viger.com/read.php?5,6827,6827#msg-6827
I would like to get information about the association rules. How do we get association rules and how do we get itemsets??]]> Laticia The Data Mining / Big Data ForumMon, 14 Mar 2022 01:11:52 -0400 https://forum.philippe-fournier-viger.com/read.php?5,6823,6823#msg-6823 https://forum.philippe-fournier-viger.com/read.php?5,6823,6823#msg-6823I received this question today:

have a doubt about high utility itemset mining. How we can define the minimum utility? I have read many papers and they said that the minimum utility value is based on the users' preferences. Actually, I do trial and error to choose the minimum utility. But, is there any logic that can be used to define the good/optimal/correct minimum utility?

My answer:

It really depends on the data and what you want to do.

High utility itemset mining can have many applications. One of them is to analyze customer purchase behavior. Then let's say that you have a store where all products are very cheap, then you may want to use a lower minimum utility otherwise you will find nothing. But if you have a store where all products are expensive and yield a high profit, you may want to use a higher minimum utility threshold because otherwise everything will be high utility.

So what I mean by this example is that for different contexts, the data is different and the threshold must be set differently

Generally,
if the threshold is set too low there are more patterns, and too many patterns is not desirable because it takes space and if you want to look at them, then there will be too many patterns... Besides the runtime can increase a lot.

And if the threshold is set too high, then you will not find enough patterns, or you may even find nothing.

So generally, people will just start from a high minutil value and decrease until they find enough patterns and not too much.

To avoid the problem of how to set minutil, some papers have redefined the problem as top-k highutility itemset mining. In that problem, instead of setting minutil, you can set directly k the number of patterns that you want to find. For example, you can say i want to find the top-500 patterns that make the most money. This is much more intuitive in my opinion than setting the minutil threshold. But it is just another way to look at the problem.

So in conclusion, there is not really one way to decide what is the best minutil value... The best depends on your applications and how many patterns you want to find.]]> webmasterphilfv The Data Mining / Big Data ForumFri, 11 Mar 2022 02:40:54 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6821,6821#msg-6821 https://forum.philippe-fournier-viger.com/read.php?5,6821,6821#msg-6821Fifth International Conference on Smart Technologies in Data Science and Communication

(SMART DSC-2022)

Hosted by: K.L. Deemed to be University,

KLEF Dates: July 21-22, 2022

Venue: Vijayawada/Guntur,

Country: India

Website: http://smartdsc2022.azurewebsites.net/

https://ocs.springer.com/misc/home/SMART-DSC2022



Special Theme:: “Data Science: Unseen patterns and Decision”

This is a CfP to submit your paper to the SMARTDSC-2022 conference; we are accepting submissions from academicians, researchers, students and software professionals.

Conference Proceedings will be published by LNNS Series (Scopus Indexed):

https://www.springer.com/series/15179



Accepted papers (after double blind review) will be published in Conference Proceedings and selected good conference published papers will be recommended to publish in the following International Journals after further reviews (freely):

• International Journal of Cloud-Computing and Super-Computing

• International Journal of Private Cloud Computing Environment and Management

• International Journal of Urban Design for Ubiquitous Computing

• International Journal of Internet of Things and Big Data

• International Journal of Advanced Research in Big Data Management System

• International Journal of Internet of Things and its Applications

• Journal of Statistical Computing and Algorithm (JSCA)

• International Journal of Multimedia and Ubiquitous Engineering

• International Journal of Software Effectiveness and Efficiency

• International Journal of u- and e- Service, Science and Technology

• International Journal of Signal Processing, Image Processing and Pattern Recognition

• International Journal of Database Theory and Application

• International Journal of Hybrid Information Technology

• International Journal of Security and its Applications (ESCI)

• International Journal of Future Generation Communication and Networking (ESCI)

• International Journal of Transportation (ESCI)

• International Journal of Grid and Distributed Computing (ESCI)

• International Journal of Software Engineering and Its Applications

• International Journal of Sensors and Its Applications for Control Systems




Conference Flow:

Conference Dates: July 21-22, 2022

Paper submission Deadline: May 10, 2022

Acceptance Notification: June 5, 2022

Submission deadline for revised papers: June 15, 2022

Author Registration Deadline: June 25, 2020



Registration: All authors can participate, we give an opportunity to all authors that have a limited budget and from far countries to choose virtual registration. For more information, please check the registration web-page at our website.

Please follow the Submission Process in the Conference Website. Alternatively, you may send your Paper(s) to the following mail id: mvnaresh@kluniversity.in

Contact:

M.Venkata Naresh

mvnaresh@kluniversity.in

+91 984 984 5169



--

Thanking you, Best Regards,

Philippe Fournier-Viger,

and

P. Sai Kiran

Conference Chair, SMART DSC-2022.

http://smartdsc2022.azurewebsites.net/

https://ocs.springer.com/misc/home/SMART-DSC2022]]> webmasterphilfv The Data Mining / Big Data ForumThu, 10 Mar 2022 05:15:20 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6820,6820#msg-6820 https://forum.philippe-fournier-viger.com/read.php?5,6820,6820#msg-6820
First, thanks for your informative website for the data mining community.
I would like to ask you about the best method to transform datasets from UCI to be usable for FIM methods.

Kind regards,]]> user The Data Mining / Big Data ForumWed, 23 Mar 2022 14:01:14 -0400 https://forum.philippe-fournier-viger.com/read.php?5,6818,6818#msg-6818 https://forum.philippe-fournier-viger.com/read.php?5,6818,6818#msg-6818
I am organizing a new special session at IEEE DSAA 2022 called Data Science for Social and Behavioral Analytics.



All accepted papers will be published in the regular proceedings of IEEE DSAA 2022.

Please see this website for more details:
http://philippe-fournier-viger.com/DSSBA_2022/index.html]]> webmasterphilfv The Data Mining / Big Data ForumWed, 09 Mar 2022 21:19:37 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6810,6810#msg-6810 https://forum.philippe-fournier-viger.com/read.php?5,6810,6810#msg-6810
I would like to use PFPM for mining periodic itemsets in airplane flight data to find periodic itemsets of buy tickets and cancelled flights.
Where can I get data?

LAT]]> Laticia The Data Mining / Big Data ForumFri, 11 Mar 2022 10:00:34 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6809,6809#msg-6809 https://forum.philippe-fournier-viger.com/read.php?5,6809,6809#msg-6809 Leapfrog The Data Mining / Big Data ForumSat, 26 Feb 2022 15:27:25 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6806,6806#msg-6806 https://forum.philippe-fournier-viger.com/read.php?5,6806,6806#msg-6806
TP | Rate | FP | Rate | Precision | Recall | F-Measure| MCC ROC | Area PRC | Area | Class
0.746 | 0.440 | 0.760 | 0.746 | 0.753 | 0.303 | 0.653 | 0.732 | verified
0.560 | 0.254 | 0.542 | 0.560 | 0.550 | 0.303 | 0.653 | 0.457 | not_verified


Why verified class has higher F-Measure than the not_verified class?]]> user The Data Mining / Big Data ForumWed, 23 Feb 2022 05:17:41 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6799,6799#msg-6799 https://forum.philippe-fournier-viger.com/read.php?5,6799,6799#msg-6799 user The Data Mining / Big Data ForumFri, 25 Feb 2022 05:20:46 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6788,6788#msg-6788 https://forum.philippe-fournier-viger.com/read.php?5,6788,6788#msg-6788
I'm writing my first paper on novel data-mining algorithms, but I have this problem with checking memory.

I use SPMF's MemoryLogger, my code is something like:

algo1.run();
algo1.printStats();

algo2.run();
algo2.printStats();

algo3.run();
algo3.printStats();

I would like to check the three algo's memory at once, but it seems that the memory just adds up for some reasons, for example if i run above code I have something like this:

algo1.memory = 126 mb
algo2.memory = 327 mb
algo3.memory = 613 mb

Then if I run each algorithm separately one by one I have this:

algo1.memory = 127 mb
algo2.memory = 168 mb
algo3.memory = 13 mb

What causes this difference? And how do I fix it?
Thanks in advance.]]> Phú Võ Lê Thanh The Data Mining / Big Data ForumMon, 07 Mar 2022 20:29:11 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6787,6787#msg-6787 https://forum.philippe-fournier-viger.com/read.php?5,6787,6787#msg-6787
This is to announce the new release of SPMF (v. 2.52)

The main modification is the addition of three new algorithms:

- The TKU-CE algorithm for heuristically mining the top-k high-utility itemsets with cross-entropy (thanks to Wei Song, Lu Liu, Chuanlong Zheng et al., for the original code)
- The TKU-CE+ algorithm for heuristically mining the top-k high-utility itemsets with cross-entropy with optimizations (thanks to Wei Song, Lu Liu, Chuanlong Zheng et al., for the original code)
- The TKQ algorithm for mining the top-k quantitative high utility itemsets (thanks to Nouioua, M. et al., for the original code)

These three algorithms are the original implementations and were published in 2021.

If you have algorithms that you would like to also include in SPMF, feel free to contact with me at philfv AT qq.com

Philippe]]> webmasterphilfv The Data Mining / Big Data ForumFri, 11 Feb 2022 01:01:04 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6785,6785#msg-6785 https://forum.philippe-fournier-viger.com/read.php?5,6785,6785#msg-6785I am looking for a dataset to be considered as a case study. It is preferred to be in the health sector domain but others are appreciated as well.

Could you please help me to find a proper dataset for FIM?

Thanks and regards,
Liara]]> Liara The Data Mining / Big Data ForumMon, 14 Feb 2022 09:49:15 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6779,6779#msg-6779 https://forum.philippe-fournier-viger.com/read.php?5,6779,6779#msg-6779Second International Conference on Ubiquitous Security

(UbiSec 2022)



Venue & Dates:

Zhangjiajie, China, November 15 - 18, 2022


Website:

http://ubisecurity.org/2022/



Introduction

The Second International Conference on Ubiquitous Security (UbiSec 2022) stems from three conference/symposium/workshop series:


(1) The well-established SpaCCS conference series with Springer LNCS: UbiSec is inspired by the SpaCCS style of three tracks (Security, Privacy, and Anonymity, "Spa" for short), which covers "Big Security" leveraging computation, communication and storage ("CCS" for short) systems and networks. UbiSec extends this style with three new tracks: Cyberspace Security, Cyberspace Privacy, and Cyberspace Anonymity.

(2) The UbiSafe symposium series: UbiSec follows the UbiSafe vision on "Ubiquitous Safety", also meaning that "YOU (will) BE SAFE" (pronounced "UbiSafe"). UbiSec extends this vision to "Ubiquitous Security", using "Big Security" to embrace NOT ONLY security, privacy and anonymity, BUT ALSO safety, reliability, dependability, trustworthiness and more, also meaning that "YOU (will) BE SEC(ure)" (pronounced "UbiSec").


(3) The IWCSS workshop series: UbiSec follows the IWCSS theme on "Cyberspace Security", with "Cyberspace" as the 5th national sovereign space besides the traditional four domains of land, sea, air, and aerospace. UbiSec extends this theme to "Ubiquitous Security", meaning that cyberspace will be secure, physical world will be secure, social networking systems will be secure, and thus "YOU (will) BE SECure"!

The UbiSec 2022 Conference ("The Conference" for short) is the second event in the series of conferences/symposia/workshops which are devoted to security, privacy and anonymity in cyberspace, physical world, and social networks. The Conference covers many dimensions including security algorithms and architectures, privacy-aware policies, regulations and techniques, anonymous computation and communication, encompassing fundamental theoretical approaches, practical experimental projects, and commercial application systems for cyberspace, physical world, and social networking systems. As applications of computer and information technology have permeated in every aspect of our daily life, the issues of security, privacy, and anonymity have become increasingly critical. The Conference will provide a forum for world-class researchers to gather and share their research achievements, emerging ideas and trends in the highly challenging research fields.


UbiSec 2022 follows the UbiSec 2021 conference in Guangzhou and also the traditions of previous successful SpaCCS/UbiSafe/IWCSS conference/symposium/workshop series, held in Nanjing, China (SpaCCS 2020/UbiSafe 2020), Guangzhou, China (IWCSS 2020); Altanta, USA (SpaCCS 2019/UbiSafe 2019), Guangzhou, China (IWCSS 2019); Melbourne, Australia (SpaCCS 2018/UbiSafe 2018), Guangzhou China (IWCSS 2018); Guangzhou, China (SpaCCS 2017/UbiSafe 2017/IWCSS 2017); Zhangjiajie, China (SpaCCS 2016/UbiSafe 2016); Helsinki, Finland (UbiSafe 2015); Beijing, China (UbiSafe 2014); Melbourne, Australia (UbiSafe 2013); Liverpool, UK (UbiSafe 2012); Changsha, China (UbiSafe 2011); Chengdu China (UbiSafe 2009); and Niagara Falls, Canada (UbiSafe 2007). The conference aims at bringing together researchers and practitioners in the world working in the research fields of security, privacy, and anonymity aspects of computer systems and networks. The conference will focus on broad areas of architectures, algorithms, techniques, and applications for cyberspace security, cyberspace privacy, and cyberspace anonymity.


Scope and Interests

Topics of particular interest include, but not limited to:

Track 1: Cyberspace Security

Security Model and Architecture
Software and System Security
Trustworthy Computing
Security in Cloud/Fog/Edge Computing and Pervasive/Ubiquitous Computing
Machine Learning and AI Security
Network Security
Attacks and Defenses
Intrusion Detection and Prevention
Security in Web Services
Security in Mobile Social Networks
Security in Internet of Things
Fraud and Cyber Crime
Accounting and Auditing
Applied Cryptography
Database Security
Authentication
Forensics and Diagnostics for Security
Information Hiding
Security in Big Data and its Applications
Blockchain and Distributed System Security
Security in Hardware, Side Channels, and CyberPhysical Systems
Security in Formal Methods and Programming Languages


Track 2: Cyberspace Privacy

Economics, Policies, Metrics, and Mechanisms of Privacy
Privacy Modeling and Analysis
Privacy-Preserving Computing
Privacy-Preserving Data Mining
Privacy-enhancing Technologies and Anonymity
Privacy for the Internet of Things
Privacy in Big Data and its Applications
Privacy-Preserving in Blockchain
Privacy-Preserving in Mobile Social Networks
Privacy-Preserving Crowdsensing
Privacy-Preserving Deep Learning


Track 3: Cyberspace Anonymity

Anonymous Data Mining and Data Sharing
Anonymous Management in Trust Relationships
Anonymous Video Analytics Technology
Anonymity Metrics, Measures and Evaluations
Anonymity Models, Hardware/Device of Anonymity
Anonymity in Wireless Communication Systems
Anonymous Communication Protocols
Anonymity in Mobile, Ad Hoc, and Wireless Sensor Networks
Anonymous Communication and Internet
Anonymous Social Networks, Structural k-Anonymity in Social Networks
Authentication Protocol Providing User Anonymity
Anonymous Information Storage and Management
Private and Anonymous Data Storage
Anonymity, Pseudonymity & Identity Management
Anonymity in Big Data and Cloud Scenarios
Anonymity in Health and Medical Databases
Anonymity in Sensor-Cloud Systems
Anonymity in Edge Computing


Submission and Publication Information

All presented papers in the conference will be published in the conference proceedings with Springer Communications in Computer and Information Science (CCIS). Papers must be clearly presented in English, must not exceed 14 pages in Springer CCIS format (or up to 20 pages with the pages over length charge), including tables, figures, references and appendices. Notice that accepted papers less than 12 pages will be tagged as Short Papers. Papers should be submitted through the EasyChair paper submission system at the conference website. Distinguished papers, after further revisions, will be considered for possible publication in SCI & EI indexed special issues of prestigious international journals. The program committee will select and give two or three "Best Paper Awards" for the conference. By submitting a paper to the conference, authors assure that if the paper is accepted, at least one author will attend the conference and present the paper.



Important Dates


Paper Submission Deadline:

June 15, 2022

Author Notification:

August 15, 2022

Author Registration Due:

September 15, 2022

Camera-Ready Paper Due:

September 15, 2022

Conference Date:

November 15 - 18, 2022



Contact



Please email inquiries concerning UbiSec 2022 to:



UbiSec2022 AT googlegroups DOT com]]> webmasterphilfv The Data Mining / Big Data ForumThu, 03 Feb 2022 11:12:44 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6768,6768#msg-6768 https://forum.philippe-fournier-viger.com/read.php?5,6768,6768#msg-6768
I'm Xiaowei. I am using the ERMiner algorithm to identify some sequence rules. However, My sequence data always starts with 85 (Sydney), most of the rule results (x = = > y) are that 85 is y, not X. I'm confused. Could you tell me why? Thanks a lot.

Best regards,

Xiaowei


My sequence data is as follows:

@CONVERTED_FROM_TEXT
@ITEM=1=ALBURY CITY
@ITEM=2=ARMIDALE REGIONAL
@ITEM=3=Australian Capital Territory
@ITEM=4=BALLINA
@ITEM=5=BATHURST REGIONAL
@ITEM=6=BAYSIDE
@ITEM=7=BEGA VALLEY
@ITEM=8=BELLINGEN
@ITEM=9=BLACKTOWN
@ITEM=10=BLAYNEY
@ITEM=11=BLUE MOUNTAINS
@ITEM=12=BOGAN
@ITEM=13=BOURKE
@ITEM=14=BROKEN HILL
@ITEM=15=BURWOOD
@ITEM=16=BYRON
@ITEM=17=CABONNE
@ITEM=18=CAMPBELLTOWN
@ITEM=19=CANADA BAY
@ITEM=20=CANTERBURY-BANKSTOWN
@ITEM=21=CARRATHOOL
@ITEM=22=CENTRAL COAST
@ITEM=23=CENTRAL DARLING
@ITEM=24=CESSNOCK
@ITEM=25=CITY OF PARRAMATTA
@ITEM=26=CLARENCE VALLEY
@ITEM=27=COBAR
@ITEM=28=COFFS HARBOUR
@ITEM=29=COOTAMUNDRA-GUNDAGAI REGIONAL
@ITEM=30=COWRA
@ITEM=31=CUMBERLAND
@ITEM=32=DUBBO REGIONAL
@ITEM=33=EUROBODALLA
@ITEM=34=FAIRFIELD
@ITEM=35=GEORGES RIVER
@ITEM=36=GLEN INNES SEVERN
@ITEM=37=GOULBURN MULWAREE
@ITEM=38=GREATER HUME SHIRE
@ITEM=39=GUNNEDAH
@ITEM=40=HAWKESBURY
@ITEM=41=HILLTOPS
@ITEM=42=HORNSBY
@ITEM=43=HUNTERS HILL
@ITEM=44=INNER WEST
@ITEM=45=JUNEE
@ITEM=46=KEMPSEY
@ITEM=47=KIAMA
@ITEM=48=KU-RING-GAI
@ITEM=49=KYOGLE
@ITEM=50=LAKE MACQUARIE
@ITEM=51=LANE COVE
@ITEM=52=LISMORE
@ITEM=53=LITHGOW CITY
@ITEM=54=LIVERPOOL
@ITEM=55=LOCKHART
@ITEM=56=MAITLAND
@ITEM=57=MID-COAST
@ITEM=58=MID-WESTERN REGIONAL
@ITEM=59=MOSMAN
@ITEM=60=MUTAWINTJI
@ITEM=61=NAMBUCCA VALLEY
@ITEM=62=NARRABRI
@ITEM=63=NARROMINE
@ITEM=64=NEWCASTLE
@ITEM=65=NORTH SYDNEY
@ITEM=66=NORTHERN BEACHES
@ITEM=67=OBERON
@ITEM=68=ORANGE
@ITEM=69=PENRITH
@ITEM=70=PORT MACQUARIE-HASTINGS
@ITEM=71=PORT STEPHENS
@ITEM=72=QUEANBEYAN-PALERANG REGIONAL
@ITEM=73=Queensland
@ITEM=74=RANDWICK
@ITEM=75=RICHMOND VALLEY
@ITEM=76=RYDE
@ITEM=77=SHELLHARBOUR
@ITEM=78=SHOALHAVEN
@ITEM=79=SILVERTON
@ITEM=80=SINGLETON
@ITEM=81=SNOWY MONARO REGIONAL
@ITEM=82=SNOWY VALLEYS
@ITEM=83=STRATHFIELD
@ITEM=84=SUTHERLAND SHIRE
@ITEM=85=SYDNEY
@ITEM=86=TAMWORTH REGIONAL
@ITEM=87=TENTERFIELD
@ITEM=88=THE HILLS SHIRE
@ITEM=89=TWEED
@ITEM=90=Victoria
@ITEM=91=WAGGA WAGGA
@ITEM=92=WARRUMBUNGLE
@ITEM=93=WAVERLEY
@ITEM=94=WENTWORTH
@ITEM=95=WILLOUGHBY
@ITEM=96=WINGECARRIBEE
@ITEM=97=WOLLONGONG
@ITEM=98=WOOLLAHRA
@ITEM=99=YASS VALLEY
@ITEM=-1=|
16 -1 85 -1 -2
6 -1 52 -1 97 -1 -2
84 -1 85 -1 11 -1 85 -1 -2
85 -1 78 -1 65 -1 -2
85 -1 71 -1 85 -1 98 -1 -2
6 -1 85 -1 65 -1 85 -1 65 -1 85 -1 89 -1 -2
64 -1 11 -1 -2
85 -1 65 -1 -2
85 -1 25 -1 85 -1 -2
72 -1 3 -1 72 -1 3 -1 72 -1 3 -1 72 -1 3 -1 72 -1 3 -1 72 -1 3 -1 72 -1 3 -1 -2
85 -1 65 -1 85 -1 16 -1 -2
85 -1 59 -1 -2
11 -1 44 -1 65 -1 25 -1 85 -1 93 -1 85 -1 93 -1 85 -1 65 -1 -2
42 -1 6 -1 78 -1 85 -1 -2
11 -1 9 -1 85 -1 66 -1 -2
66 -1 65 -1 85 -1 65 -1 85 -1 65 -1 85 -1 65 -1 85 -1 -2
85 -1 34 -1 85 -1 6 -1 -2
85 -1 65 -1 -2
97 -1 11 -1 77 -1 97 -1 77 -1 85 -1 -2
85 -1 11 -1 44 -1 -2
44 -1 59 -1 -2
71 -1 65 -1 85 -1 65 -1 2 -1 87 -1 71 -1 -2
85 -1 11 -1 19 -1 85 -1 65 -1 85 -1 -2
64 -1 66 -1 85 -1 9 -1 11 -1 85 -1 11 -1 93 -1 11 -1 85 -1 65 -1 93 -1 85 -1 98 -1 93 -1 11 -1 -2
97 -1 71 -1 74 -1 47 -1 93 -1 97 -1 85 -1 22 -1 84 -1 66 -1 40 -1 25 -1 47 -1 84 -1 53 -1 85 -1 97 -1 84 -1 6 -1 97 -1 30 -1 41 -1 84 -1 97 -1 84 -1 47 -1 84 -1 93 -1 84 -1 97 -1 84 -1 65 -1 97 -1 84 -1 97 -1 85 -1 97 -1 85 -1 37 -1 97 -1 84 -1 85 -1 78 -1 97 -1 3 -1 85 -1 84 -1 66 -1 -2
85 -1 44 -1 -2
85 -1 6 -1 85 -1 -2
85 -1 65 -1 85 -1 65 -1 85 -1 -2
44 -1 85 -1 66 -1 85 -1 -2
89 -1 22 -1 85 -1 42 -1 66 -1 -2
98 -1 65 -1 -2
85 -1 22 -1 -2
85 -1 65 -1 85 -1 -2
89 -1 64 -1 85 -1 11 -1 85 -1 6 -1 64 -1 24 -1 64 -1 85 -1 64 -1 65 -1 64 -1 22 -1 59 -1 -2
9 -1 25 -1 97 -1 -2
93 -1 85 -1 -2
16 -1 85 -1 -2
85 -1 6 -1 85 -1 65 -1 85 -1 65 -1 85 -1 11 -1 85 -1 22 -1 71 -1 57 -1 85 -1 26 -1 46 -1 70 -1 46 -1 4 -1 26 -1 70 -1 46 -1 70 -1 26 -1 46 -1 26 -1 89 -1 26 -1 16 -1 4 -1 89 -1 26 -1 16 -1 70 -1 57 -1 -2
93 -1 85 -1 -2
3 -1 85 -1 66 -1 85 -1 -2
9 -1 24 -1 40 -1 9 -1 40 -1 9 -1 11 -1 40 -1 11 -1 40 -1 11 -1 40 -1 88 -1 11 -1 40 -1 -2
25 -1 11 -1 98 -1 93 -1 76 -1 85 -1 -2
56 -1 70 -1 -2
85 -1 74 -1 -2
84 -1 66 -1 22 -1 70 -1 66 -1 44 -1 65 -1 66 -1 -2
93 -1 85 -1 -2
85 -1 93 -1 98 -1 93 -1 85 -1 -2
66 -1 74 -1 11 -1 85 -1 44 -1 25 -1 76 -1 25 -1 85 -1 19 -1 44 -1 85 -1 65 -1 85 -1 98 -1 85 -1 98 -1 85 -1 66 -1 85 -1 65 -1 85 -1 11 -1 85 -1 93 -1 98 -1 74 -1 93 -1 74 -1 85 -1 65 -1 85 -1 59 -1 66 -1 85 -1 6 -1 66 -1 -2
3 -1 85 -1 -2
97 -1 85 -1 -2
85 -1 66 -1 -2
85 -1 65 -1 85 -1 66 -1 85 -1 98 -1 65 -1 85 -1 65 -1 85 -1 65 -1 85 -1 65 -1 59 -1 85 -1 65 -1 85 -1 65 -1 85 -1 66 -1 65 -1 85 -1 65 -1 93 -1 65 -1 93 -1 65 -1 59 -1 95 -1 65 -1 85 -1 65 -1 59 -1 65 -1 85 -1 59 -1 65 -1 59 -1 65 -1 59 -1 85 -1 66 -1 88 -1 9 -1 65 -1 85 -1 65 -1 42 -1 65 -1 42 -1 84 -1 6 -1 85 -1 84 -1 40 -1 11 -1 44 -1 85 -1 11 -1 65 -1 85 -1 65 -1 85 -1 65 -1 6 -1 -2
74 -1 85 -1 98 -1 85 -1 74 -1 85 -1 -2
6 -1 66 -1 85 -1 -2
85 -1 93 -1 85 -1 -2
85 -1 65 -1 59 -1 85 -1 66 -1 85 -1 -2
85 -1 44 -1 -2
85 -1 98 -1 85 -1 84 -1 -2
85 -1 65 -1 -2
98 -1 85 -1 93 -1 85 -1 42 -1 24 -1 95 -1 85 -1 74 -1 85 -1 74 -1 -2
85 -1 48 -1 93 -1 85 -1 98 -1 85 -1 48 -1 85 -1 11 -1 98 -1 85 -1 20 -1 85 -1 48 -1 6 -1 85 -1 48 -1 -2
85 -1 93 -1 85 -1 -2
6 -1 85 -1 11 -1 42 -1 85 -1 93 -1 6 -1 -2
85 -1 93 -1 84 -1 97 -1 -2
85 -1 66 -1 85 -1 -2
85 -1 98 -1 85 -1 59 -1 -2
59 -1 85 -1 -2
65 -1 85 -1 65 -1 85 -1 11 -1 -2
95 -1 76 -1 95 -1 85 -1 95 -1 11 -1 85 -1 42 -1 76 -1 85 -1 98 -1 66 -1 85 -1 65 -1 85 -1 31 -1 85 -1 19 -1 76 -1 95 -1 93 -1 76 -1 9 -1 -2
85 -1 93 -1 85 -1 65 -1 -2
80 -1 57 -1 16 -1 -2
85 -1 65 -1 85 -1 65 -1 -2
86 -1 85 -1 86 -1 -2
24 -1 64 -1 11 -1 -2
85 -1 11 -1 93 -1 -2
85 -1 22 -1 85 -1 44 -1 64 -1 -2
65 -1 85 -1 -2
85 -1 11 -1 3 -1 -2
85 -1 98 -1 85 -1 6 -1 -2
85 -1 65 -1 85 -1 65 -1 85 -1 65 -1 11 -1 25 -1 44 -1 11 -1 85 -1 -2
85 -1 20 -1 85 -1 93 -1 85 -1 31 -1 85 -1 54 -1 85 -1 11 -1 85 -1 95 -1 93 -1 85 -1 44 -1 3 -1 -2
65 -1 85 -1 6 -1 -2
85 -1 83 -1 25 -1 15 -1 65 -1 15 -1 85 -1 25 -1 15 -1 85 -1 93 -1 85 -1 84 -1 15 -1 84 -1 74 -1 85 -1 15 -1 72 -1 3 -1 18 -1 11 -1 85 -1 74 -1 6 -1 97 -1 84 -1 66 -1 85 -1 66 -1 85 -1 66 -1 85 -1 66 -1 35 -1 85 -1 98 -1 85 -1 37 -1 85 -1 65 -1 66 -1 85 -1 66 -1 84 -1 85 -1 74 -1 31 -1 84 -1 -2
44 -1 85 -1 65 -1 85 -1 65 -1 -2
64 -1 97 -1 64 -1 -2
24 -1 85 -1 24 -1 93 -1 24 -1 -2
85 -1 19 -1 -2
93 -1 97 -1 7 -1 19 -1 -2
85 -1 65 -1 85 -1 65 -1 85 -1 65 -1 85 -1 -2
78 -1 77 -1 85 -1 -2
85 -1 93 -1 85 -1 -2


Also, my parameter data is as follows: Minsup=0.02, Mincof=0.6,Max antecedent size=1, Max consequent size=1


The rules identified are below:

NEWCASTLE ==> BLUE MOUNTAINS
HAWKESBURY ==> NORTH SYDNEY
GOULBURN MULWAREE ==> NORTHERN BEACHES
QUEANBEYAN-PALERANG REGIONAL ==> Australian Capital Territory
RYDE ==> NORTH SYDNEY
RYDE ==> NORTHERN BEACHES
RYDE ==> CANADA BAY
RYDE ==> BLUE MOUNTAINS
GOULBURN MULWAREE ==> SUTHERLAND SHIRE
NORTH SYDNEY ==> SYDNEY
NORTHERN BEACHES ==> SYDNEY
BAYSIDE ==> SYDNEY
PORT STEPHENS ==> SYDNEY
RANDWICK ==> SYDNEY
BLUE MOUNTAINS ==> SYDNEY
RYDE ==> SYDNEY
SHELLHARBOUR ==> SYDNEY
SHOALHAVEN ==> SYDNEY
CANTERBURY-BANKSTOWN ==> SYDNEY
CESSNOCK ==> SYDNEY
CITY OF PARRAMATTA ==> SYDNEY
CUMBERLAND ==> SYDNEY
GOULBURN MULWAREE ==> SYDNEY
HAWKESBURY ==> SYDNEY
HORNSBY ==> SYDNEY
THE HILLS SHIRE ==> HAWKESBURY
THE HILLS SHIRE ==> BLUE MOUNTAINS
RYDE ==> WAVERLEY
WAVERLEY ==> SYDNEY
CITY OF PARRAMATTA ==> WAVERLEY
CUMBERLAND ==> WAVERLEY
WILLOUGHBY ==> SYDNEY
CUMBERLAND ==> WILLOUGHBY
RYDE ==> WOOLLAHRA
WOOLLAHRA ==> SYDNEY
HAWKESBURY ==> BAYSIDE
HAWKESBURY ==> BLUE MOUNTAINS
MID-COAST ==> BYRON]]> 1164399783@qq.com The Data Mining / Big Data ForumThu, 17 Feb 2022 08:42:19 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6766,6766#msg-6766 https://forum.philippe-fournier-viger.com/read.php?5,6766,6766#msg-6766Eleventh International Conference on Model & Data Engineering (MEDI) will be held from 21 to 24 November 2022 in Cairo, Egypt. Its main objective is to provide a forum for the dissemination of research accomplishments and to promote the interaction and collaboration between the models and data research communities. MEDI2022 provides an international platform for the presentation of research on models and data theory, development of advanced technologies related to models and data and their advanced applications. This international scientific event, initiated by researchers from Middle eastern countries, aims also at promoting the creation of north-south scientific networks, projects and faculty/student exchanges.

MEDI Keynote Speakers
Vincent S Tseng: Distinguished Professor, Dept. Computer Science , National Chiao Tung University, Taiwan

Athman Bouguettaya: Professor, The University of Sydney, Australia

Submission Guidelines and Instructions
Authors are invited to submit English-language research and application papers representing original, previously unpublished work. Duplicate submissions are not allowed. Papers must be submitted as a single PDF document, via the Easychair system.

Submissions must conform to Springer's LNCS style (Latex style only for camera-ready papers) and should not exceed 14 pages. Submitted papers will be carefully evaluated based on originality, significance, technical soundness, and clarity of exposition.

The program committee may decide to accept a submission as a short paper if it reports interesting results but does not justify a publication as a full paper.

Publication and Special issue
All accepted papers will be published in Lecture Notes in Computer Science (LNCS) by Springer-Verlag.

Best papers will be invited for submission in special issues of well-ranked Journals:

To Be Announced *** under negotiation ***

Important Dates
Abstract submission: July 4, 2022

Full-paper submission: July 11, 2022

Acceptance notification: Friday, August 26, 2022

Early bird registration: Thursday, September 23, 2022

Camera ready: Friday, September 23, 2022

Contact
All questions about organization and submissions should be emailed to:

medi2022@nu.edu.eg]]> webmasterphilfv The Data Mining / Big Data ForumSun, 23 Jan 2022 01:22:02 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6764,6764#msg-6764 https://forum.philippe-fournier-viger.com/read.php?5,6764,6764#msg-6764
This is to let you know that a new version of SPMF has been released. There are two new algorithms:

The SFU-CE algorithm for mining skyline frequent high utility itemsets using the cross-entropy method (thanks to Wei Song, Chuanlong Zheng et al., for the original code)

The POERMH algorithm for mining partially ordered episode rules in a sequence of events, using the head support (thanks to Yangming Chen et al. for the original code)

Besides, I have also fixed a minor bug in the TKG and gSpan algorithm by deactivating the skip strategy.

Best regards,]]> webmasterphilfv The Data Mining / Big Data ForumThu, 20 Jan 2022 01:40:49 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6754,6754#msg-6754 https://forum.philippe-fournier-viger.com/read.php?5,6754,6754#msg-6754The 35th International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems IEA/AIE 2022 https://ieaaie2022.wordpress.com/ continues the tradition of emphasizing on applications of applied intelligent systems to solve real-life problems in all areas including engineering, science, industry, automation & robotics, business & finance, medicine and biomedicine, bioinformatics, cyberspace, and human-machine.

The conference will publish a Special issue in Applied Intelligence https://www.springer.com/journal/10489/, after the conference selecting the best papers in terms of quality, reviews, and presentation. The selection will be done after the conference through emails sent to the corresponding authors with detailed instructions. Therefore we advise all authors to do their best in good presentation.

The sequences would be:
-submission to the conference;
-acceptance at the conference and inclusion in the proceedings;
-and only then possible invitation (with further instructions) to the journal special issue by its guest editors later.

Organized in cooperation with :

Asia Pacific Neural Network Society (APNNA) / Assoc. for the Advancement of Art. Intell. (AAAI) / Assoc. for Computing Machinery (ACM/SIGART) / Austrian Assoc. for Art. Intelligence (OEGAI) / Catalan Assoc. for Art. Intelligence (ACIA) / Graz University of Technology / Italian Art. Intelligence Assoc. (AI*IA) / Iwate Prefectural University, Japan / Japanese Society for Art. Intelligence (JSAI) / Lithuanian Computer Soc. – AI Section (LIKS-AIS) / Spanish Society for Art. Intelligence (AEPIA) / Soc. for the Study of AI and the Sim. of Behav. (AISB) /Taiwanese Association for Consumer Electronics (TACE) / Taiwanese Association for Artificial Intelligence (TAAI) / Texas State University, USA / University of Klagenfurt, Austria

The organization is coordinated with Kitakyushu Convention and Visitors Association, Japan.

Topics of interest include, but are not limited to:

Adaptive Control
Ambient Intelligence
Argumentation Systems
Artificial Immune Systems
Automated Reasoning
Autonomous Agents
Bayesian Networks
Bio-informatics
Case-based Reasoning
Computer Animation
Computer Vision
Cognitive Models
Constraint Programming
Data Mining
Decision Support Systems
Description Logics
Evolutionary Computation
Expert Systems
Fuzzy Logic
Games
Information Retrieval
Heuristic Search
Human Robot Interaction
Intelligent Systems
Knowledge Representation Machine Learning
Meta-heuristics
Model-based Reasoning
Multi-Agent Systems
Multi-Media Processing
Natural Language Processing
Neural Networks
Non-Monotonic Logics
Optimization
Planning and Scheduling
Preference Reasoning
Privacy Preserving Data Mining

Robotics
Semantic Web
Smart Graphics
Social Networks
Soft Computing
Speech Recognition
Swarm Intelligence
Temporal and Spatial Reasoning
Uncertainty
User Modeling
Ontologies
Important Dates

Submission deadline: January 31st, 2021
Final Notification: February 28, 2022
Registration: April 1, 2022
Camera Ready April 1, 2022
Conference Sessions: July 19 –22, 2022
The pdf version of the Call for Paper can be obtained HERE]]> webmasterphilfv The Data Mining / Big Data ForumThu, 20 Jan 2022 01:41:41 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6748,6748#msg-6748 https://forum.philippe-fournier-viger.com/read.php?5,6748,6748#msg-6748
I'm Xiaowei, a lecture at Zhejiang Gongshang University. Recently, I saw the expression "TRuleGrowth has better memory scalability" in your articles named “Mining Sequential Rules Common to Several Sequences with the Window Size Constraint”. However, I didn't understang the memory scalability. Could you define and explain this term for me?

Thanks a lot.

Best wishes,
Xiaowei]]> 1164399783@qq.com The Data Mining / Big Data ForumThu, 20 Jan 2022 01:39:08 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6747,6747#msg-6747 https://forum.philippe-fournier-viger.com/read.php?5,6747,6747#msg-6747
Given graph dataset of two identical graphs:
t # 0
v 0 2
v 1 2
v 2 2
v 3 2
v 4 2
e 0 1 0
e 1 2 3
e 1 4 3
e 2 3 3
e 3 4 3
t # 1
v 0 2
v 1 2
v 2 2
v 3 2
v 4 2
e 0 1 0
e 1 2 3
e 1 4 3
e 2 3 3
e 3 4 3

cgspan does not output the maximal frequent subgraph

t # 0 * 2
v 0 2
v 1 2
v 2 2
v 3 2
v 4 2
e 0 1 0
e 1 2 3
e 1 4 3
e 2 3 3
e 3 4 3
x 0 1

Thanks,
Shaul]]> szevin The Data Mining / Big Data ForumTue, 18 Jan 2022 04:46:28 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6746,6746#msg-6746 https://forum.philippe-fournier-viger.com/read.php?5,6746,6746#msg-6746
I'm searching for the source code of FP-Tree, FP-Stream.

If anyone has these algorithms, that will really help me
please send me

Thanks]]> sama The Data Mining / Big Data ForumTue, 18 Jan 2022 05:31:01 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6745,6745#msg-6745 https://forum.philippe-fournier-viger.com/read.php?5,6745,6745#msg-6745
I saw the source code in Java of SPMF.

Can anyone make a C# version?]]> Sellena The Data Mining / Big Data ForumTue, 18 Jan 2022 05:32:10 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6741,6741#msg-6741 https://forum.philippe-fournier-viger.com/read.php?5,6741,6741#msg-6741http://www.cacml.net/

2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML
2022)

Website: http://www.cacml.net/

Venue: Hangzhou, China (both online and in-person)

Conference Date: March 25-27, 2022

2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML 2022)
will be held in Hangzhou, China during March 25-27, 2022. It is sponsored by The
International Society for Applied Computing (ISAC) and The Technical Institute for
Engineers (T.I.E.). We fully understand some participants cannot attend the conference
in-person due to COVID-19, so we will hold our conference both online and in-person,
thus you could attend the conference online and do the online presentation.
During the upcoming conference, the invited renowned professors will share with us
the recent innovations in the fields of Algorithms, Computing and Machine Learning.
The conference will mainly feature on keynote speeches as well as peer-reviewed
paper presentations. In addition, social program or academic visit will be arranged to
encourage communication, discussion or cooperation among the researchers in this
field.
We invite submissions of papers presenting an original high-quality research and
development for the conference. All papers must be written in English and will be peer?reviewed by technical committees of the Conference and all accepted papers will be
published in the conference proceedings.
*Conference Speakers:
Keynote Speaker I:
Prof. Witold Pedrycz, University of Alberta, Canada (IEEE Life Fellow)
Keynote Speaker II:
Prof. Chin-Chen Chang, Feng Chia University, Taiwan (IEEE Fellow and CS Fellow, Chair
Professor and IET Fellow, AAIA Fellow)
Keynote Speaker III:
Prof. Miguel Ángel Sotelo, University of Alcalá, Spain (IEEE Fellow)
Keynote Speaker IV:
Distinguished Prof. Philippe Fournier-Viger, Shenzhen University, China
Keynote Speaker V:
Prof. Jie Yang, Shanghai Jiao Tong University, China
*Call for papers:
Algorithms
Analysis of algorithms
Ant colony algorithm
Approximation algorithm
Combinatorial search
Competitive analysis
Computability theory
Computational complexity theory
Embarrassingly parallel problem
Emergent algorithm
Evolutionary algorithm
Genetic algorithm
Graph exploration algorithm
Ambient computing
Artificial and Computational Intelligence
Big data-oriented computing
Cloud Computing
Cognitive computing
DNA (genetic) computing
Embedded computing
Entertainment computing
Fog-computing
Deep and Reinforcement Learning
Machine Learning for Network Slicing Optimization
Machine Learning for 5G system
Machine Learning for User Behavior Prediction
New Innovative Machine Learning Methods
Optimization of Machine Learning Methods
Machine learning for multimedia
Machine learning for Internet of Things
Distributed machine learning algorithms
Intelligent cloud-support communications
Intelligent ressource allocation
Intelligent cooperative networks
Intelligent wireless communications
(for more topics: http://www.cacml.net/Call%20for%20Papers.html )
*Publication and indexing:
★All accepted and registered papers will be included in CACML 2022 conference
proceedings and published by Conference Publishing Services (CPS), which will be
submitted for inclusion in IEEE Xplore and CSDL. The conference proceedings will also
be submitted for indexing by EI Compendex, Scopus, INSPEC, EI's Engineering
Information Index, ISI Thomson's Scientific and Technical Proceedings, ISTP/ISI
Proceedings, and Current Contents on Diskette.
*Submission Methods:
1. Online Submission System: https://cmt3.research.microsoft.com/CACML2022
2. Submission Email: cacml@applied-computing.net
Submission guidelines: http://www.cacml.net/Submission%20Guidelines.html
*Join the conference as:
Authors:
Authors are expected to submit full papers to the submission system for further review
by our Technical Committees. All accepted papers after proper registration and
presentation in the conference will be published and submitted for indexing.
Presenters Only:
The presenters are expected to submit abstracts only for presentation in the
conference without paper publication in the conference proceedings.
Listeners:
Listeners are expected to attend the conference without paper presentation or
publication.
Reviewers:
PhD-holders in the research fields of Algorithms, Computing and Machine Learning are
welcome to be our reviewers and a certificate can be issued.
Sponsors/Partners:
If you are interested in cooperating with us, such as sponsoring or being a partner of
CACML 2022, you are welcome to contact us at: cacml@applied-computing.net
*Contact us:
Website: http://www.cacml.net/
Conference Secretary: Ms. Annie Yang
Tel: +852 5319 3049
Email: cacml@applied-computing.net
If you have any question or request about our conference, no matter regarding
submission, registration, participation or any further question, please send email to us
and you will get feedback within 24 hours.]]> webmasterphilfv The Data Mining / Big Data ForumThu, 13 Jan 2022 22:02:21 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6734,6734#msg-6734 https://forum.philippe-fournier-viger.com/read.php?5,6734,6734#msg-6734
For the past 2 years, during the implementation of the final project of the master's course, I have been asking you questions and you have answered them very well. Thank you for your guidance. next. I am again interested in implementing one of the plans I have in mind

I want to implement an algorithm that works like a hui-miner, based on list (utility-list)
But my idea is to put each list in a 2x2 triangular top matrix after I make it. My question is, is an algorithm similar to this implemented? Is there a code similar to this in the code implemented in spmf to create a matrix of these lists? The prunings I want to perform are twu,liu and U-prune


I had a request from you. Do you have the THUI article source code? If you do not have it, can you tell us which general structure of this algorithm is similar to which of the algorithms implemented in SPMF?
(Mining top-k high utility itemsets with effective threshold raising strategies from Srikumar Krishnamoorthy)

Regards]]> tianikowa The Data Mining / Big Data ForumThu, 13 Jan 2022 23:08:47 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6729,6729#msg-6729 https://forum.philippe-fournier-viger.com/read.php?5,6729,6729#msg-6729
Just a short message to wish you a happy new year.

And thanks for participating to the forum.

If you want to discuss anything feel free to post in the forum. We can discuss data mining or some more general topics related to academia.

Best regards,

Philippe]]> webmasterphilfv The Data Mining / Big Data ForumSat, 01 Jan 2022 16:01:37 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6721,6721#msg-6721 https://forum.philippe-fournier-viger.com/read.php?5,6721,6721#msg-6721Could you please give me some ideas regarding my Ph.D. (CS)? Actually, I have already done literature on FIM, HUIM Clos-FHUIM, etc with different approaches but unfortunately could not find a remarkable gap (according to Ph.D. research). Please advise.

I have also submitted the paper to "Applied Intelligence" on the topic of "Closed-HUFIM: An Efficient Closed High Utility Frequent Itemsets Mining Algorithm Using Cutoff and Suffix Utility". I know it has a minor contribution but enough to publish the paper but not for research.

Thanks in advance.
Ph.D. (CS) Scholar]]> i201606 The Data Mining / Big Data ForumSat, 01 Jan 2022 15:58:53 -0500 https://forum.philippe-fournier-viger.com/read.php?5,6714,6714#msg-6714 https://forum.philippe-fournier-viger.com/read.php?5,6714,6714#msg-6714Big Data Analytics and Knowledge Discovery - DAWAK
August 22-24, 2022
WU (Vienna University of Economics and Business), Vienna, Austria,

http://www.dexa.org/dawak2022

IMPORTANT DATES
--------------------------------------------------------------------------------
Abstract submission deadline: March 7, 2022
Paper submission deadline: March 7, 2022
Acceptance notifications: May 10, 2022
Camera ready copy due: June 1, 2022

SUBMISSION GUIDELINES
--------------------------------------------------------------------------------
Authors are invited to submit original research contributions or experience
reports in English. DaWak will accept submissions of both short and full papers.

Short papers - up to 6 pages on preliminary work, vision papers, or industrial
applications.
Full papers - up to 12 pages, more mature than short papers, contain more
theory and experimetnal evaluation, or present a survey (tutorial style) of some
hot or not yet explored topics.

Papers exceeding the page limit or deviating from the formatting requirement
are desk rejected.

Formatting guidelines: http://www.dexa.org/formatting_guidelines

Online Papers Submission: https://easychair.org/conferences/?conf=dawak2022

Submitted papers will be carefully evaluated based on originality, significance,
technical soundness, and clarity of exposition. Duplicate submissions are not
allowed and will be rejected immediately without further reviewing. Authors are
expected to agree to the following terms: "I understand that the submission must
not overlap substantially with any other paper that I am a co-author of or that
is currently submitted elsewhere. Furthermore, previously published papers with
any overlap are cited prominently in this submission."

Questions about this policy or how it applies to a specific paper should be
directed to the PC Co-chairs.

PUBLICATION
--------------------------------------------------------------------------------
All DaWaK 2022 accepted papers will be published in a volume of "Lecture Notes
in Computer Science" (LNCS) by Springer. LNCS volumes are indexed in the
Conference Proceedings Citation Index (CPCI), part of Clarivate Analytics’
Web of Science; Scopus; EI Engineering Index; Google Scholar; DBLP; etc.

Distinguished papers, after further revisions, will be considered for
publication in a special issue of a Q1 international journal (currently
under approval).

MAIN TOPICS
--------------------------------------------------------------------------------
Theoretical models for extended data warehouses and big data
Conceptual model foundations for big data
Modelling diverse big data sources
Parallel processing
Parallel DBMS technology
Distributed system architectures
Scalability and parallelization using Map-Reduce, Spark, and related systems
Query languages
Query processing and optimization
Semantics for big data intelligence
Data warehouse and data lake architectures
Pre-processing and data cleaning
Integration of data warehousing, OLAP cubes, and data mining
Polystore and multistore architectures
NoSQL storage systems
Cloud infrastructures for big data
Metadata for big data frameworks
Big data storage and indexing
Big data analytics: algorithms, techniques, and systems
Big data quality and provenance
Big data search and discovery
Big data management for mobile applications
Analytic workflows
Graph analytics
Analytics for unstructured, semi-structured, and structured data
Analytics for temporal, spatial, spatio-temporal, and mobile data
Analytics for data streams and sensor data
Real-time/right-time and event-based analytics
Privacy and security in analytics
Data visualization
Big data application deployment
Data science products
Novel applications of text mining for big data
Machine learning: auto AI, deep learning applications

COMMITTEES
--------------------------------------------------------------------------------
Program Committee co-Chairs
Robert Wrembel, Poznan University of Technology, Poland
Johann Gamper, Free University of Bozen-Bolzano, Italy

Program Committee members: http://www.dexa.org/dawak2022 (under construction)
Steering Committee: http://www.dexa.org/committee

CONTACT
--------------------------------------------------------------------------------
All questions about submissions should be emailed to dexa@iiwas.org


---------------]]> webmasterphilfv The Data Mining / Big Data ForumFri, 24 Dec 2021 01:03:35 -0500