Matching Social Issues to Technologies for Civic Tech by Association Rule Mining using Weighted Casual Confidence

by   Masato Kikuchi, et al.

More than 80 civic tech communities in Japan are developing information technology (IT) systems to solve their regional issues. Collaboration among such communities across different regions assists in solving their problems because some groups have limited IT knowledge and experience for this purpose. Our objective is to realize a civic tech matchmaking system to assist such communities in finding better partners with IT experience in their issues. In this study, as the first step toward collaboration, we acquire relevant social issues and information technologies by association rule mining. To meet our challenge, we supply a questionnaire to members of civic tech communities and obtain answers on their faced issues and their available technologies. Subsequently, we match the relevant issues and technologies from the answers. However, most of the issues and technologies in this questionnaire data are infrequent, and there is a significant bias in their occurrence. Here, it is difficult to extract truly relevant issues–technologies combinations with existing interestingness measures. Therefore, we introduce a new measure called weighted casual confidence, and show that our measure is effective for mining relevant issues–technologies pairs.


page 1

page 2

page 3

page 4


A Bibliometric Perspective of Social Science Scientific Communities of Pakistan and India

In this study, we use research publication data from the field of social...

Information cartography in association rule mining

Association Rule Mining is a data mining method for discovering the inte...

Numerical Association Rule Mining: A Systematic Literature Review

Numerical association rule mining is a widely used variant of the associ...

Social Network Processes in the Isabelle and Coq Theorem Proving Communities

We identify the main actors in the Isabelle and Coq communities and desc...

Formal and Computational Properties of the Confidence Boost of Association Rules

Some existing notions of redundancy among association rules allow for a ...

Please sign up or login with your details

Forgot password? Click here to reset