Who Rules Japan? Popular Participation in the Japanese Legal Process

"The dramatic growth of the Japanese economy in the postwar period, and its meltdown in the 1990s, has attracted sustained interest in the power dynamics underlying the management of Japan’s administrative state. Scholars and commentators have long debated over who wields power in Japan, asking the fundamental question: who really governs Japan? This important volume revisits this question by turning its attention to the regulation and design of the Japanese legal system. With essays covering the new lay-judge system in Japanese criminal trials, labour dispute resolution panels, prison policy, gendered justice, government lawyers, welfare administration and administrative transparency, this comprehensive book explores the players and processes in Japan’s administration of justice."--publisher website

Japanese women and the ‘new’ administrative state

This chapter questions whether Japanese administrative law reform agenda aimed at promoting greater transparency in decision-making will necessarily lead to better policy outcomes for Japanese women. The chapter evaluates recent legislative reforms and policymaking initiatives in the area of sexual harassment and argues that these developments do not improve the situation for Japanese women. The reason is that the new rules effectively charge corporations with the responsibility to self-regulate, thereby transforming sexual harassment from a public issue of human rights to a domestic issue of corporate governance.

Administrative Placement of the Information Systems Discipline in Universities - A SWOT Analysis of Queensland University of Technology

In some Queensland universities, Information Systems academics have moved out of Business Faculties. This study uses a pilot SWOT analysis to examine the ramifications of Information Systems academics being located within or outside of the Business Faculty. The analysis provides a useful basis for decision makers in the School studied, to exploit opportunities and minimise external threats. For Information Systems academics contemplating administrative relocation of their group, the study also offers useful insights. The study presages a series of further SWOT analyses to provide a range of perspectives on the relative merits of having Information Systems academics administratively located inside versus outside Business faculties.

A Reliable Basis for Approximate Association Rules

For most of the work done in developing association rule mining, the primary focus has been on the efficiency of the approach and to a lesser extent the quality of the derived rules has been emphasized. Often for a dataset, a huge number of rules can be derived, but many of them can be redundant to other rules and thus are useless in practice. The extremely large number of rules makes it difficult for the end users to comprehend and therefore effectively use the discovered rules and thus significantly reduces the effectiveness of rule mining algorithms. If the extracted knowledge can’t be effectively used in solving real world problems, the effort of extracting the knowledge is worth little. This is a serious problem but not yet solved satisfactorily. In this paper, we propose a concise representation called Reliable Approximate basis for representing non-redundant approximate association rules. We prove that the redundancy elimination based on the proposed basis does not reduce the belief to the extracted rules. We also prove that all approximate association rules can be deduced from the Reliable Approximate basis. Therefore the basis is a lossless representation of approximate association rules.

Interestingness Measures for Multi-Level Association Rules

Association rule mining is one technique that is widely used when querying databases, especially those that are transactional, in order to obtain useful associations or correlations among sets of items. Much work has been done focusing on efficiency, effectiveness and redundancy. There has also been a focusing on the quality of rules from single level datasets with many interestingness measures proposed. However, with multi-level datasets now being common there is a lack of interestingness measures developed for multi-level and cross-level rules. Single level measures do not take into account the hierarchy found in a multi-level dataset. This leaves the Support-Confidence approach,which does not consider the hierarchy anyway and has other drawbacks, as one of the few measures available. In this paper we propose two approaches which measure multi-level association rules to help evaluate their interestingness. These measures of diversity and peculiarity can be used to help identify those rules from multi-level datasets that are potentially useful.

Concise representations for association rules in multi-level datasets

Association rule mining has made many advances in the area of knowledge discovery. However, the quality of the discovered association rules is a big concern and has drawn more and more attention recently. One problem with the quality of the discovered association rules is the huge size of the extracted rule set. Often for a dataset, a huge number of rules can be extracted, but many of them can be redundant to other rules and thus useless in practice. Mining non-redundant rules is a promising approach to solve this problem. In this paper, we firstly propose a definition for redundancy; then we propose a concise representation called Reliable basis for representing non-redundant association rules for both exact rules and approximate rules. An important contribution of this paper is that we propose to use the certainty factor as the criteria to measure the strength of the discovered association rules. With the criteria, we can determine the boundary between redundancy and non-redundancy to ensure eliminating as many redundant rules as possible without reducing the inference capacity of and the belief to the remaining extracted non-redundant rules. We prove that the redundancy elimination based on the proposed Reliable basis does not reduce the belief to the extracted rules. We also prove that all association rules can be deduced from the Reliable basis. Therefore the Reliable basis is a lossless representation of association rules. Experimental results show that the proposed Reliable basis can significantly reduce the number of extracted rules.

Investigating the use of association rules in improving recommender systems

Recommender systems are widely used online to help users find other products, items etc that they may be interested in based on what is known about that user in their profile. Often however user profiles may be short on information and thus when there is not sufficient knowledge on a user it is difficult for a recommender system to make quality recommendations. This problem is often referred to as the cold-start problem. Here we investigate whether association rules can be used as a source of information to expand a user profile and thus avoid this problem, leading to improved recommendations to users. Our pilot study shows that indeed it is possible to use association rules to improve the performance of a recommender system. This we believe can lead to further work in utilising appropriate association rules to lessen the impact of the cold-start problem.