Victor J. Rayward-Smith

Affiliations:
  • University of East Anglia, Norwich, UK


According to our database1, Victor J. Rayward-Smith authored at least 66 papers between 1977 and 2014.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Nonmetric multidimensional scaling: A perturbation model for privacy-preserving data clustering.
Stat. Anal. Data Min., 2014

2013
Optimising sum-of-squares measures for clustering multisets defined over a metric space.
Discret. Appl. Math., 2013

2012
Editorial for the JMMA, Number 1, 2012.
J. Math. Model. Algorithms, 2012

Non-linear Dimensionality Reduction for Privacy-Preserving Data Classification.
Proceedings of the 2012 International Conference on Privacy, 2012

2011
CLAM: Clustering Large Applications Using Metaheuristics.
J. Math. Model. Algorithms, 2011

Measure based metrics for aggregated data.
Intell. Data Anal., 2011

A Novel Multi-Objective Genetic Algorithm for Clustering.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2011, 2011

Non-metric Multidimensional Scaling for Privacy-Preserving Data Clustering.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2011, 2011

2009
Data mining and operational research: techniques and applications.
J. Oper. Res. Soc., 2009

Editorial.
J. Math. Model. Algorithms, 2009

Using a Clustering Algorithm for Domain Related Ontology Construction.
Proceedings of the KEOD 2009 - Proceedings of the International Conference on Knowledge Engineering and Ontology Development, Funchal, 2009

2008
Special Issue Arising from the IDEAL 2007 Conference.
J. Math. Model. Algorithms, 2008

Internal quality measures for clustering in metric spaces.
Int. J. Bus. Intell. Data Min., 2008

Analysis of heuristics for the UET two-machine flow shop problem with time delays.
Comput. Oper. Res., 2008

2007
Statistics to measure correlation for data mining applications.
Comput. Stat. Data Anal., 2007

2006
Clustering Rules: A Comparison of Partitioning and Hierarchical Clustering Algorithms.
J. Math. Model. Algorithms, 2006

The application and effectiveness of a multi-objective metaheuristic algorithm for partial classification.
Eur. J. Oper. Res., 2006

Adapting <i>k</i>-means for supervised clustering.
Appl. Intell., 2006

2005
The discovery of association rules from tabular databases comprising nominal and ordinal attributes.
Intell. Data Anal., 2005

Developments on a Multi-objective Metaheuristic (MOMH) Algorithm for Finding Interesting Sets of Classification Rules.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2005

Using Concept Taxonomies for Effective Tree Induction.
Proceedings of the Computational Intelligence and Security, International Conference, 2005

Metaheuristics for clustering in KDD.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2004
The Application of K-Medoids and PAM to the Clustering of Rules.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2004

2003
The Use of a Supervised k-Means Algorithm on Real-Valued Data with Applications in Health.
Proceedings of the Developments in Applied Artificial Intelligence, 2003

Handling categorical data in rule induction.
Proceedings of the Artificial Neural Nets and Genetic Algorithms, 2003

Algorithms for Identification Key Generation and Optimization with Application to Yeast Identification.
Proceedings of the Applications of Evolutionary Computing, 2003

Data mining rules using multi-objective evolutionary algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2003

2002
Determining a unique defining DNA sequence for yeast species using hashing techniques.
Bioinform., 2002

2001
Project Scheduling: Recent Models, Algorithms and Applications.
J. Oper. Res. Soc., 2001

The next release problem.
Inf. Softw. Technol., 2001

Data mining for indicators of early mortality in a database of clinical records.
Artif. Intell. Medicine, 2001

Discovery of Association Rules in Tabular Data.
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001

1999
Discretisation of Continuous Commercial Database Features for a Simulated Annealing Data Mining Algorithm.
Appl. Intell., 1999

Minimal cost linkages in graphs.
Ann. Oper. Res., 1999

Rule Induction Using a Reverse Polish Representation.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

1998
Steiner Minimal Trees.
J. Oper. Res. Soc., 1998

Parallel Computing in Optimization.
J. Oper. Res. Soc., 1998

Fitness Distance Correlation and Ridge Functions.
Proceedings of the Parallel Problem Solving from Nature, 1998

1997
Feature Subset Selection within a Simulated Annealing Data Mining Algorithm.
J. Intell. Inf. Syst., 1997

The Cryptanalysis of a Three Rotor Machine Using a Genetic Algorithm.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

1996
Uet Flow Shop Scheduling with Delays.
RAIRO Theor. Informatics Appl., 1996

Discovering Knowledge in Commercial Databases Using Modern Heuristic Techniques.
Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), 1996

The Royal Road Functions: Description, Intent and Experimentation.
Proceedings of the Evolutionary Computing, 1996

1995
NP-Completeness of a Combinator Optimization Problem.
Notre Dame J. Formal Log., 1995

Using Genetic Algorithms to Solve the Radio Link Frequency Assignment Problem.
Proceedings of the Artificial Neural Nets and Genetic Algorithms, 1995

The Radio Link Frequency Assignment Problem: A Case Study Using Genetic Algorithms.
Proceedings of the Evolutionary Computing, 1995

1994
Worst Case Scheduling for Parallel Functional Programs.
J. Funct. Program., 1994

A Unified Paradigm for Parallel Genetic Algorithms.
Proceedings of the Evolutionary Computing, 1994

1993
Efficiency considerations in the implementation of parallel branch-and-bound.
Ann. Oper. Res., 1993

1992
Open shop scheduling with delays.
RAIRO Theor. Informatics Appl., 1992

1991
The (Δ, <i>d, d′</i>, Δ - 1)-problem with applications to computer networks.
Ann. Oper. Res., 1991

Branch-and-bound as a higher-order function.
Ann. Oper. Res., 1991

1990
Applications of UET Scheduling Theory to the Implementation of Declarative Languages.
Comput. J., 1990

1988
The general problem solving algorithm and its implementation.
New Gener. Comput., 1988

On Process Assignment in Parallel Computing.
Inf. Process. Lett., 1988

1987
The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays.
Inf. Process. Lett., 1987

UET scheduling with unit interprocessor communication delays.
Discret. Appl. Math., 1987

1986
On finding steiner vertices.
Networks, 1986

1985
Efficient Combinator Code.
Comput. Lang., 1985

1984
Communication Problems on MIMD Parallel Computers.
Inf. Process. Lett., 1984

A Survey on Syntactic Error Recovery and Repair.
Comput. Lang., 1984

1983
Preface.
Discret. Appl. Math., 1983

1980
Finding Linear and Circular Sequences of Minimal and Maximal Total Adjacency.
Inf. Process. Lett., 1980

1979
On Computing the Smith Normal Form of an Integer Matrix.
ACM Trans. Math. Softw., 1979

1977
Hypergrammars: An Extension of Macrogrammars.
J. Comput. Syst. Sci., 1977

Using procedures in list processing.
Proceedings of the Strathclyde ALGOL 68 Conference, Glasgow, 1977


  Loading...