Assessing taxpayer response to legislative changes: A case study of ‘in-house’ fringe benefits rules

On 22 October 2012, the Australian Federal Government announced the removal of the $1,000 in-house fringe benefits concession when used as part of a salary packaging arrangement. At the time of the announcement, the Federal Government predicted that the removal of the concession would contribute additional tax revenue of $445 million over the following four years as well as an increase of GST payments to the States and Territories. However, anecdotal evidence at the same time indicated that the Australian employer response was to immediately stop providing employees with such in-house fringe benefits via salary sacrificing arrangements. Data presented in this article, collected from a combination of interviews with tax managers of four Australian entities as well as a review of the published archival data, confirms that the abolition of the $1,000 in-house fringe benefits concession was perceived as a negative change, whereby employees were considered the ‘big losers’ despite assertions by the Federal Government to the contrary. Using a conceptual map of tax rule change developed by Oats and Sadler, this article seeks to understand the reasons for this fringe benefits tax change and taxpayer response. In particular, the economic and political factors, and the responses of the relevant taxpayers (employers) are explored. Drawing on behavioural economic concepts, the actions, attitudes and response of employers to the rule change are also examined. The research findings suggest that the decision by Australian employers to cease providing the in-house fringe benefits as part of a salary-packaging arrangement after the legislative amendment was impacted by more than simple rational behaviour.

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.

Generating rules with predicates, terms and variables from the pruned neural networks

Artificial neural networks (ANN) have demonstrated good predictive performance in a wide range of applications. They are, however, not considered sufficient for knowledge representation because of their inability to represent the reasoning process succinctly. This paper proposes a novel methodology Gyan that represents the knowledge of a trained network in the form of restricted first-order predicate rules. The empirical results demonstrate that an equivalent symbolic interpretation in the form of rules with predicates, terms and variables can be derived describing the overall behaviour of the trained ANN with improved comprehensibility while maintaining the accuracy and fidelity of the propositional rules.

Changing the rules in use? An examination of social enterprise in local governance

As multi-stakeholder entities that explicitly inhabit both social and economic domains, social enterprises pose new challenges and possibilities for local governance. In this paper, we draw on new institutional theory to examine the ways in which locally-focused social enterprises disrupt path dependencies and rules in use within local government. Rather than examining the more commonly asked question of the influence of the state on social enterprise, our purpose here is to examine the impacts of social enterprise on governmental institutions at the local level. Our discussion is based on a mixed-methods study, including an online survey of 66 local government staff, document analysis, and in-depth interviews with 24 social enterprise practitioners and local government actors working to support social enterprise development in Victoria, Australia. We find that, in some instances, the hybrid nature of social enterprise facilitates ‘joining up’ between different functional areas of local government. Beyond organisational relationships, social enterprise also influences local governance through the reinterpretation and regeneration of institutionalised public spaces.