http://researchonline.federation.edu.au/vital/access/manager/Index ${session.getAttribute("locale")} 5 A new modified global k-means algorithm for clustering large data sets http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3555 Wed 28 Apr 2021 12:28:10 AEST ]]> An incremental approach for the construction of a piecewise linear classifier http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3556 Wed 28 Apr 2021 12:24:03 AEST ]]> Chebyshev multivariate polynomial approximation : alternance interpretation http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:16191 Wed 24 Aug 2022 11:09:36 AEST ]]> Texture image classification using pixel N-grams http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:15822 Wed 23 Mar 2022 17:03:11 AEDT ]]> Pixel N-grams for mammographic lesion classification http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:15823 Wed 23 Mar 2022 16:56:46 AEDT ]]> An Agile group aware process beyond CRISP-DM: A hospital data mining case study http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:15837 Wed 23 Mar 2022 12:57:49 AEDT ]]> Finite alternation theorems and a constructive approach to piecewise polynomial approximation in chebyshev norm http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:14377 Wed 07 Apr 2021 14:02:28 AEST ]]> Optimality conditions and optimization methods for quartic polynomial optimization http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:13929 Wed 07 Apr 2021 14:02:01 AEST ]]> On the reconstruction of polytopes http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:13772 3 there are two d-polytopes with d- 1 nonsimple vertices, isomorphic (d- 3) -skeleta and nonisomorphic face lattices. In particular, the result (1) is best possible for 4-polytopes. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.]]> Wed 07 Apr 2021 14:01:53 AEST ]]> The excess degree of a polytope http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:13474 Wed 07 Apr 2021 14:01:37 AEST ]]> Nonsmooth DC programming approach to clusterwise linear regression : Optimality conditions and algorithms http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:12991 Wed 07 Apr 2021 14:01:11 AEST ]]> Analysis and comparison of co-occurrence matrix and pixel n-gram features for mammographic images http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:12639 Wed 07 Apr 2021 14:00:52 AEST ]]> Characterization theorem for best polynomial spline approximation with free knots, variable degree and fixed tails http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:11946 Wed 07 Apr 2021 13:57:14 AEST ]]> Piecewise linear classifiers based on nonsmooth optimization approaches http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:11230 Wed 07 Apr 2021 13:56:34 AEST ]]> Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:11174 Wed 07 Apr 2021 13:56:30 AEST ]]> Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:10544 Wed 07 Apr 2021 13:55:52 AEST ]]> Global optimality conditions and optimization methods for polynomial programming problems http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:10152 Wed 07 Apr 2021 13:55:28 AEST ]]> Global optimality conditions and optimization methods for constrained polynomial programming problems http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:9631 Wed 07 Apr 2021 13:54:53 AEST ]]> Nonsmooth optimization algorithm for solving clusterwise linear regression problems http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:9601 Wed 07 Apr 2021 13:54:51 AEST ]]> Patient admission prediction using a pruned fuzzy min-max neural network with rule extraction http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:7588 Wed 07 Apr 2021 13:47:03 AEST ]]> An algorithm for clusterwise linear regression based on smoothing techniques http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:7515 Wed 07 Apr 2021 13:46:58 AEST ]]> Compiling and using input-output frameworks through collaborative virtual laboratories http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:5876 Wed 07 Apr 2021 13:45:27 AEST ]]> Nonsmooth nonconvex optimization approach to clusterwise linear regression problems http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:4951 Wed 07 Apr 2021 13:44:32 AEST ]]> Detecting K-complexes for sleep stage identification using nonsmooth optimization http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:4728 Wed 07 Apr 2021 13:44:15 AEST ]]> A novel piecewise linear classifier based on polyhedral conic and max-min separabilities http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:4279 Wed 07 Apr 2021 13:43:43 AEST ]]> A modified parallel optimization system for updating large-size time-evolving flow matrix http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:4257 Wed 07 Apr 2021 13:43:42 AEST ]]> Classification through incremental max-min separability http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:4082 Wed 07 Apr 2021 13:43:25 AEST ]]> Codifferential method for minimizing nonsmooth DC functions http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:4072 Wed 07 Apr 2021 13:43:24 AEST ]]> An efficient algorithm for the incremental construction of a piecewise linear classifier http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3928 Wed 07 Apr 2021 13:34:58 AEST ]]> Fast modified global k-means algorithm for incremental cluster construction http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3822 Wed 07 Apr 2021 13:34:52 AEST ]]> A generalized subgradient method with piecewise linear subproblem http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3807 Wed 07 Apr 2021 13:34:51 AEST ]]> The choice of a similarity measure with respect to its sensitivity to outliers http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3803 Wed 07 Apr 2021 13:34:50 AEST ]]> Characterization theorem for best linear spline approximation with free knots http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3802 Wed 07 Apr 2021 13:34:50 AEST ]]> Optimisation of operations of a water distribution system for reduced power usage http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3705 Wed 07 Apr 2021 13:34:43 AEST ]]> Application of nonsmooth optimisation to data analysis http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3521 Wed 07 Apr 2021 13:34:29 AEST ]]> Minimization of the sum of minima of convex functions and its application to clustering http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:2740 Wed 07 Apr 2021 13:33:46 AEST ]]> A feature selection approach for unsupervised classification based on clustering http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:2739 Wed 07 Apr 2021 13:33:46 AEST ]]> Workload coverage through nonsmooth optimization http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1807 Wed 07 Apr 2021 13:32:52 AEST ]]> Optimisation solvers and problem formulations for solving a data clustering problem http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1608 Wed 07 Apr 2021 13:32:43 AEST ]]> Queueing programming models in telecommunication network maintenance http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1607 Wed 07 Apr 2021 13:32:43 AEST ]]> New algorithm to find a shape of a finite set of points http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1587 Wed 07 Apr 2021 13:32:41 AEST ]]> Coverage in WLAN with minimum number of access points http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1431 Wed 07 Apr 2021 13:32:29 AEST ]]> Coverage in WLAN : Optimization model and algorithm http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1430 Wed 07 Apr 2021 13:32:29 AEST ]]> A new algorithm for the placement of WLAN access point based on nonsmooth optimization technique http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1429 Wed 07 Apr 2021 13:32:29 AEST ]]> Optimization in wireless local area network http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1428 Wed 07 Apr 2021 13:32:29 AEST ]]> Optimal placement of access point in WLAN based on a new algorithm http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1427 Wed 07 Apr 2021 13:32:29 AEST ]]> Solving Euclidian travelling salesman problem using discrete-gradient based clustering and kohonen neural network http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1356 Wed 07 Apr 2021 13:32:24 AEST ]]> Supervised data classification via max-min separability http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1219 Wed 07 Apr 2021 13:32:16 AEST ]]> Facility location via continuous optimization with discontinuous objective functions http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:898 Wed 07 Apr 2021 13:31:53 AEST ]]> Optimization solvers and problem formulations for solving data clustering problems http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:897 Wed 07 Apr 2021 13:31:53 AEST ]]> Classes and clusters in data analysis http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:764 Wed 07 Apr 2021 13:31:44 AEST ]]> Implementation of novel methods of global and nonsmooth optimization : GANSO programming library http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:107 Wed 07 Apr 2021 13:30:56 AEST ]]> Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:83 Wed 07 Apr 2021 13:30:54 AEST ]]> An algorithm for minimizing clustering functions http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:82 Wed 07 Apr 2021 13:30:54 AEST ]]> Connectivity of cubical polytopes http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:14273 = 3, the graph of a cubical d-polytope with minimum degree 5 is min{delta, 2d - 2}-connected. Second, we show, for any d >= 4, that every minimum separator of cardinality at most 2d - 3 in such a graph consists of all the neighbours of some vertex and that removing the vertices of the separator from the graph leaves exactly two components, with one of them being the vertex itself. (C) 2019 Elsevier Inc. All rights reserved.]]> Tue 21 Dec 2021 09:27:27 AEDT ]]> Lower bound theorems for general polytopes http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:13991 = 0.62d. This confirms a conjecture of Grunbaum, for these values of m. For v = 2d + 1, we solve the same problem when m = 1 or d - 2; the solution was already known for m = d - 1. In all these cases, we give a characterisation of the minimising polytopes. We also show that there are many gaps in the possible number of m-faces: for example, there is no polytope with 80 edges in dimension 10, and a polytope with 407 edges can have dimension at most 23.]]> Tue 15 Aug 2023 14:37:44 AEST ]]> Polytopes close to being simple http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:14666 Tue 15 Aug 2023 14:31:57 AEST ]]> Schur functions for approximation problems http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:16555 Tue 06 Sep 2022 16:01:47 AEST ]]> Multivariate approximation by polynomial and generalized rational functions http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:17481 Tue 04 Apr 2023 12:15:07 AEST ]]> Almost simplicial polytopes : the lower and upper bound theorems http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:14449 Thu 25 Nov 2021 11:25:51 AEDT ]]> Linkedness of cartesian products of complete graphs http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:17450 Thu 23 Mar 2023 11:34:10 AEDT ]]> Automatic sleep stage identification: difficulties and possible solutions http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:4367 Thu 21 Dec 2023 11:29:16 AEDT ]]> Generalised rational approximation and its application to improve deep learning classifiers http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:14734 Thu 14 Mar 2024 14:35:43 AEDT ]]> Chebyshev multivariate polynomial approximation and point reduction procedure http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:15164 Thu 07 Jul 2022 14:57:54 AEST ]]> Edge connectivity of simplicial polytopes http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:19088 Mon 18 Mar 2024 13:23:26 AEDT ]]> The linkedness of cubical polytopes: the cube http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:15492 Mon 13 Dec 2021 11:18:41 AEDT ]]> Minimum number of edges of polytopes with 2d + 2 vertices http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:17606 Mon 01 May 2023 14:05:23 AEST ]]> Visual character N-grams for classification and retrieval of radiological images http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:5829 Fri 18 Jun 2021 13:01:59 AEST ]]>