John Roddick | Flinders University of South Australia (original) (raw)
Papers by John Roddick
Knowledge and Information Systems, 2005
... DOI 10.1007/s10115-003-0139-0 Visualising hierarchical associations Aaron Ceglar1,John Roddic... more ... DOI 10.1007/s10115-003-0139-0 Visualising hierarchical associations Aaron Ceglar1,John Roddick1,Paul Calder1,Chris Rainsford1,2 ... Subsequent algorithms include work by Srikant and Agrawal (1997), Hipp et al. (1998), Thomas and Sarawagi (1998), Mao (2001), Ong et al. ...
Proceedings of the …, 2009
Itemsets, which are treated as intermediate results in association mining, have attracted signifi... more Itemsets, which are treated as intermediate results in association mining, have attracted significant research due to the inherent complexity of their generation. However, there is currently little literature focusing upon the interactions between itemsets, the nature of which may potentially contain valuable information. This paper presents a novel tree-based approach to discovering item-set interactions, a task which cannot be undertaken by current association mining techniques.
Proceedings of the 3rd Asia-Pacific …, 2006
The integration of data from different sources often leads to the adoption of schemata that entai... more The integration of data from different sources often leads to the adoption of schemata that entail a loss of information in respect of one or more of the data sets being combined. The coercion of data to conform to the type of the unified attribute is one of the major reasons for this information loss. We argue that for maximal information retention it would be useful to be able to define attributes over domains capable of accommodating multiple types, that is, domains that potentially allow an attribute to take its values from ...
Tutorials, posters, panels and …, Nov 1, 2007
There are a number of issues for information systems which are required to collect data urgently ... more There are a number of issues for information systems which are required to collect data urgently that are not well accommodated by current conceptual modelling methodologies and as a result the modelling step (and the use of databases) is often omitted. Such issues include the fact that
Intelligent data Analysis in BioMedicine and Pharmacology, Verona, Italy, 2006
There are a variety of criticisms of medical data mining which has led, in some cases, to the tec... more There are a variety of criticisms of medical data mining which has led, in some cases, to the technology being overlooked as a tool. This paper presents a discussion of six of the strongest arguments against the application of data mining to the complex field of human medicine. The aim of the paper is to raise the predominant issues and suggest solutions whilst also opening the issues for further consideration by both medical and information technology communities.
Flinders University of South Australia, Technical Report, Apr 1, 2002
Knowledge Discovery and Management Laboratory Flinders Institute for Research in Science and Tech... more Knowledge Discovery and Management Laboratory Flinders Institute for Research in Science and Technology Flinders University of South Australia Technical Report KDM-02-ООб April 2002 On the Ethics of Data Mining Kirsten Wahlstrom1, John F. Roddick2, Rick Sarre3, Vladimir Estivill-Castro4 and Denise deVries2 1 School of Computer and Information Science. University of South Australia, Mawson Lakes Campus, Mawson Lakes, South Australia 5095, Australia. " School of Informatics and Engineering, Flinders University of South Australia, Adelaide, ...
Proceedings of the 26th …, Feb 1, 2003
The relative difference between two data values is of interest in a number of application domains... more The relative difference between two data values is of interest in a number of application domains including temporal and spatial applications, schema versioning, data warehousing (particularly data preparation), internet searching, validation and error correction, and data mining. Moreover, consistency across systems in determining such distances and the robustness of such calculations is essential in some domains and useful in many. Despite this, there is no generally adopted approach to determining such ...
ACM Transactions on Graphics, 1984
(With CD-ROM), 2004
Chapter 4 A Tutorial on Meta-Heuristics for Optimization Shu-Chuan Chu, Chin-Shiuh Shieh, and Joh... more Chapter 4 A Tutorial on Meta-Heuristics for Optimization Shu-Chuan Chu, Chin-Shiuh Shieh, and John F. Roddick Nature has inspired ... CR 0.5/* Crossover Rate*/ # define MR 0.05/* Mutation Rate*/ /* Macro for random number between 0 and 1*/ # define RAND ((float) rand ...
Lecture Notes in Computer Science, 2002
... It can be re-ferred to as the equal-average equal-variance nearest neighbor search (EENNS) al... more ... It can be re-ferred to as the equal-average equal-variance nearest neighbor search (EENNS) algorithm. ... The proposed efficient searching algorithm using previous medoid index, tri-angular inequality elimination (TIE) and partial distance search (PDS) algo-rithm applied ...
Lecture Notes in Computer Science, 2014
2011 Second International Conference on Innovations in Bio-inspired Computing and Applications, 2011
The ε constrained method is an algorithm transformation method, which can convert algorithms for ... more The ε constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using the ε level comparison that compares the search points based on the constraint violation of them. We proposed the ε constrained particle swarm optimizer εPSO, which is the combination of the ε constrained method and particle swarm optimization. In the εPSO, the agents who satisfy the constraints move to optimize the objective function and the agents who don't satisfy the constraints move to satisfy the constraints. But sometimes the velocity of agents becomes too big and they fly away from feasible region. In this study, to solve this problem, we propose to divide agents into some groups and control the maximum velocity of agents adaptively by comparing the movement of agents in each group. The effectiveness of the improved εPSO is shown by comparing it with various methods on well known nonlinear constrained problems.
Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99, 1999
Schema versioning provides a mechanism for handling change in the structure of database systems a... more Schema versioning provides a mechanism for handling change in the structure of database systems and has been investigated widely, both in the context of static and tem-poral databases. With the growing interest in spatial and spatio-temporal data as well as the mechanisms for ...
ACM SIGMOD Record, 2004
Spatial and temporal database systems, both in theory and in practice, have developed dramaticall... more Spatial and temporal database systems, both in theory and in practice, have developed dramatically over the past two decades to the point where usable commercial systems, underpinned by a robust theoretical foundation, are now starting to appear. While much remains to be done, topics for research must be chosen carefully to avoid embarking on impractical or unprofitable areas. This is particularly true for doctoral research where the candidate must build a tangible contribution in a relatively short time.
ABSTRACT This letter presents a no-reference blocking artifact measure based on analysis of color... more ABSTRACT This letter presents a no-reference blocking artifact measure based on analysis of color discontinuities in YUV color space. Color shift and color disappearance are first analyzed in JPEG images. For color-shifting and color-disappearing areas, the blocking artifact scores are obtained by computing the gradient differences across the block boundaries in U component and Y component, respectively. An overall quality score is then produced as the average of the local ones. Extensive simulations and comparisons demonstrate the efficiency of the proposed method.
Knowledge and Information Systems, 2005
... DOI 10.1007/s10115-003-0139-0 Visualising hierarchical associations Aaron Ceglar1,John Roddic... more ... DOI 10.1007/s10115-003-0139-0 Visualising hierarchical associations Aaron Ceglar1,John Roddick1,Paul Calder1,Chris Rainsford1,2 ... Subsequent algorithms include work by Srikant and Agrawal (1997), Hipp et al. (1998), Thomas and Sarawagi (1998), Mao (2001), Ong et al. ...
Proceedings of the …, 2009
Itemsets, which are treated as intermediate results in association mining, have attracted signifi... more Itemsets, which are treated as intermediate results in association mining, have attracted significant research due to the inherent complexity of their generation. However, there is currently little literature focusing upon the interactions between itemsets, the nature of which may potentially contain valuable information. This paper presents a novel tree-based approach to discovering item-set interactions, a task which cannot be undertaken by current association mining techniques.
Proceedings of the 3rd Asia-Pacific …, 2006
The integration of data from different sources often leads to the adoption of schemata that entai... more The integration of data from different sources often leads to the adoption of schemata that entail a loss of information in respect of one or more of the data sets being combined. The coercion of data to conform to the type of the unified attribute is one of the major reasons for this information loss. We argue that for maximal information retention it would be useful to be able to define attributes over domains capable of accommodating multiple types, that is, domains that potentially allow an attribute to take its values from ...
Tutorials, posters, panels and …, Nov 1, 2007
There are a number of issues for information systems which are required to collect data urgently ... more There are a number of issues for information systems which are required to collect data urgently that are not well accommodated by current conceptual modelling methodologies and as a result the modelling step (and the use of databases) is often omitted. Such issues include the fact that
Intelligent data Analysis in BioMedicine and Pharmacology, Verona, Italy, 2006
There are a variety of criticisms of medical data mining which has led, in some cases, to the tec... more There are a variety of criticisms of medical data mining which has led, in some cases, to the technology being overlooked as a tool. This paper presents a discussion of six of the strongest arguments against the application of data mining to the complex field of human medicine. The aim of the paper is to raise the predominant issues and suggest solutions whilst also opening the issues for further consideration by both medical and information technology communities.
Flinders University of South Australia, Technical Report, Apr 1, 2002
Knowledge Discovery and Management Laboratory Flinders Institute for Research in Science and Tech... more Knowledge Discovery and Management Laboratory Flinders Institute for Research in Science and Technology Flinders University of South Australia Technical Report KDM-02-ООб April 2002 On the Ethics of Data Mining Kirsten Wahlstrom1, John F. Roddick2, Rick Sarre3, Vladimir Estivill-Castro4 and Denise deVries2 1 School of Computer and Information Science. University of South Australia, Mawson Lakes Campus, Mawson Lakes, South Australia 5095, Australia. " School of Informatics and Engineering, Flinders University of South Australia, Adelaide, ...
Proceedings of the 26th …, Feb 1, 2003
The relative difference between two data values is of interest in a number of application domains... more The relative difference between two data values is of interest in a number of application domains including temporal and spatial applications, schema versioning, data warehousing (particularly data preparation), internet searching, validation and error correction, and data mining. Moreover, consistency across systems in determining such distances and the robustness of such calculations is essential in some domains and useful in many. Despite this, there is no generally adopted approach to determining such ...
ACM Transactions on Graphics, 1984
(With CD-ROM), 2004
Chapter 4 A Tutorial on Meta-Heuristics for Optimization Shu-Chuan Chu, Chin-Shiuh Shieh, and Joh... more Chapter 4 A Tutorial on Meta-Heuristics for Optimization Shu-Chuan Chu, Chin-Shiuh Shieh, and John F. Roddick Nature has inspired ... CR 0.5/* Crossover Rate*/ # define MR 0.05/* Mutation Rate*/ /* Macro for random number between 0 and 1*/ # define RAND ((float) rand ...
Lecture Notes in Computer Science, 2002
... It can be re-ferred to as the equal-average equal-variance nearest neighbor search (EENNS) al... more ... It can be re-ferred to as the equal-average equal-variance nearest neighbor search (EENNS) algorithm. ... The proposed efficient searching algorithm using previous medoid index, tri-angular inequality elimination (TIE) and partial distance search (PDS) algo-rithm applied ...
Lecture Notes in Computer Science, 2014
2011 Second International Conference on Innovations in Bio-inspired Computing and Applications, 2011
The ε constrained method is an algorithm transformation method, which can convert algorithms for ... more The ε constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using the ε level comparison that compares the search points based on the constraint violation of them. We proposed the ε constrained particle swarm optimizer εPSO, which is the combination of the ε constrained method and particle swarm optimization. In the εPSO, the agents who satisfy the constraints move to optimize the objective function and the agents who don't satisfy the constraints move to satisfy the constraints. But sometimes the velocity of agents becomes too big and they fly away from feasible region. In this study, to solve this problem, we propose to divide agents into some groups and control the maximum velocity of agents adaptively by comparing the movement of agents in each group. The effectiveness of the improved εPSO is shown by comparing it with various methods on well known nonlinear constrained problems.
Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99, 1999
Schema versioning provides a mechanism for handling change in the structure of database systems a... more Schema versioning provides a mechanism for handling change in the structure of database systems and has been investigated widely, both in the context of static and tem-poral databases. With the growing interest in spatial and spatio-temporal data as well as the mechanisms for ...
ACM SIGMOD Record, 2004
Spatial and temporal database systems, both in theory and in practice, have developed dramaticall... more Spatial and temporal database systems, both in theory and in practice, have developed dramatically over the past two decades to the point where usable commercial systems, underpinned by a robust theoretical foundation, are now starting to appear. While much remains to be done, topics for research must be chosen carefully to avoid embarking on impractical or unprofitable areas. This is particularly true for doctoral research where the candidate must build a tangible contribution in a relatively short time.
ABSTRACT This letter presents a no-reference blocking artifact measure based on analysis of color... more ABSTRACT This letter presents a no-reference blocking artifact measure based on analysis of color discontinuities in YUV color space. Color shift and color disappearance are first analyzed in JPEG images. For color-shifting and color-disappearing areas, the blocking artifact scores are obtained by computing the gradient differences across the block boundaries in U component and Y component, respectively. An overall quality score is then produced as the average of the local ones. Extensive simulations and comparisons demonstrate the efficiency of the proposed method.