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

  title={Matching Social Issues to Technologies for Civic Tech by Association Rule Mining using Weighted Casual Confidence},
  author={Masato Kikuchi and Shun Shiramatsu and Ryota Kozakai and Tadachika Ozono},
  journal={IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology},
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… 

Tables from this paper



Towards Continuous Collaboration on Civic Tech Projects: Use Cases of a Goal Sharing System Based on Linked Open Data

The authors' Web system, called GoalShare, which gathers linked open data LOD of hierarchical goals to address social issues, was applied to civic hackathons held in the city of Nagoya in Japan and showed that goal structures input by team members themselves with enough instruction time were relatively detailed but varied widely among teams.

A linked open data based system utilizing structured open innovation process for addressing collaboratively public concerns in regional societies

An open innovation process based web platform for gathering public issues, forming public goals, and for structuring concrete subgoals as goal trees to facilitate participation and use SOCIA ontology to structure goal information as linked open data is developed.

Building k‐partite association graphs for finding recommendation patterns from questionnaire data

The synergy between the well‐known Apriori algorithm and k‐partite graph modelling is proposed to discover frequent recommendation patterns from questionnaire data using graph centrality and similarity measures and the large number of association rules are analysed to discover meaningful spatial structures in non‐metric spaces.

Comparing Machine Learning and Knowledge Discovery in DataBases: An Application to Knowledge Discovery in Texts

  • Y. Kodratoff
  • Computer Science
    Machine Learning and Its Applications
  • 2001
This chapter will provide a compelling example of a real-life set of rules obtained by what I call KDT techniques, and show that the definition I give of KDD can be almost directly applied to text analysis, and that will lead to a very restrictive definition of Knowledge Discovery in Texts (KDT).

Fast Algorithms for Mining Association Rules

Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.

Confidence interval of probability estimator of Laplace smoothing

The confidence intervals of the estimator of Laplace smoothing are investigated and it is shown that the likelihood function for this confidence interval is the same as the likelihood of a maximum likelihood estimated value of a probability of Bernoulli trials.

Using conservative estimation for conditional probability instead of ignoring infrequent case

This paper proposes using the lower limit of confidence interval on posterior distribution determined by the observed frequencies to ascertain conditional probability and in the experiments, this method outperformed other popular estimators.

) Both of them are useful. In addition, {Conf ℓ , WCC} is more useful

    Open data and civic apps: First-generation failures, second-generation improvements

    • Commun. ACM
    • 2016