Artificial intelligence is increasingly trained on data that nobody is allowed to see. Millions of smartphones hold keystroke patterns, hospitals hold medical records and factories hold sensor readings from production lines, and privacy rules, commercial interests and simple prudence dictate that this raw information should stay where it was created. Federated learning was invented for precisely this world: instead of pooling data on a central server, devices train models locally and share only the resulting parameters. Yet a deceptively mundane obstacle has lingered at the edge of this paradigm. A large family of classification algorithms can digest only discrete categories, not the continuous numbers the physical world produces, and carving those numbers into categories has always been treated as a centralized task that assumes somebody can see everything. Researchers at the University of the Basque Country and the Basque Center for Applied Mathematics in Spain now report in Data Mining and Knowledge Discovery a way to complete this final preprocessing step collectively, without any device ever surrendering a single raw data point, and with the users’ statistical summaries traveling to the server only once.
The recipe behind federated learning is conceptually simple. Each participant, whether a phone, a hospital or an industrial controller, holds a private dataset and fits a local model on it. The model parameters, never the data, travel to a coordinating server, which aggregates the local contributions into a global model and sends the result back down; each such exchange constitutes a communication round, and the loop repeats until the global model converges. Because raw records never leave the devices that generated them, the framework offers privacy by architecture: a would-be attacker is forced to devise separate offensive techniques for every individual user rather than breach a single consolidated data store. The design is also naturally scalable, since participating devices contribute their own computational resources and distribute the workload of training. The paradigm already underpins deployed systems, from keyboard query prediction on Android devices and human trajectory forecasting to manufacturing defect detection, energy prediction for electric vehicles, phenotyping of electronic health records and the analysis of distributed biomedical images.
The overlooked snag lies in the nature of the numbers. Supervised classification learns a function that maps an instance, described by a vector of attribute values, to a class label, and some of the most interpretable and computationally economical classifiers, notably those built on Bayesian networks such as the naive Bayes classifier, require every input variable to be discrete. Continuous measurements such as blood pressure, voltage or acceleration must therefore be preprocessed through discretization: an algorithm slices the variable’s range into a set of disjoint intervals delimited by cut points, and each observation is subsequently assigned to one of those intervals. Supervised variants go further, consulting the class labels to position the cuts so that the intervals best separate the classes; entropy-based methods, for instance, recursively choose the split that maximizes information gain and apply the Minimum Description Length principle to decide when to stop. The difficulty in a federated setting is that every participant must apply the identical slicing policy. If two users convert the same blood-pressure value into different categories, their locally trained models become mutually incompatible, and no aggregation scheme can reconcile them afterwards.
The seemingly obvious remedy, letting each device discretize its own data and ship the resulting policy to the server for merging, collapses under its own combinatorics. Because different users observe different fragments of the underlying distribution, they inevitably produce heterogeneous interval boundaries, and reconciling thousands of mismatched cut points quickly becomes prohibitively expensive for the coordinating server. Until now, the literature offered essentially no general answer: the only prior federated discretization method known to the authors was tailored to a single, specific classifier. The Spanish team, Jose Luis Flores and Borja Calvo of the University of the Basque Country together with Aritz Pérez of the Basque Center for Applied Mathematics, set out instead to build something classifier-agnostic and algorithm-agnostic: a general framework into which any discretization method can be plugged and from which any downstream classifier requiring categorical inputs can benefit.
The core idea is to replace raw data with a compact statistical portrait. Each user fits a class-conditional univariate Gaussian mixture model to every continuous attribute, estimating the parameters with the expectation–maximization algorithm; the number of mixture components grows only logarithmically, set to the ceiling of the base-two logarithm of the class’s local instance count. Every component of every mixture is distilled into what the authors call a representative, a quadruple carrying the component’s mean, its class label, its standard deviation and a weight equal to the number of original instances it stands for. The weights within a single user’s representative set sum exactly to the size of that user’s dataset, so the relative mass of the population is preserved even though the data itself is discarded. Intuitively, each representative behaves like a labeled, weighted and deliberately fuzzy data point whose standard deviation quantifies the uncertainty around its position. Users transmit only these representatives to the server, which unions them into a global set, runs a discretization algorithm over it and broadcasts the resulting cut points back to everyone.
The framework’s flexibility stems from the fact that different discretization algorithms can exploit different slices of the representative quadruple. The simplest adaptation, equal-width discretization, is unsupervised and uses only the means: it locates their minimum and maximum and divides that range into a requested number of equally sized bins, at a cost dominated by a single sort of the representatives. Equal-frequency discretization adds the weights, constructing a weighted empirical cumulative distribution function and placing cut points at its quantiles, so that each bin captures roughly the same share of the represented population. Entropy-based discretization brings in the class labels: it recursively evaluates candidate cuts by information gain and, following the Minimum Description Length principle, halts once further cuts are no longer justified. The most information-hungry variant, kernel density-based discretization, consumes everything, including the standard deviations. It rebuilds class-conditional density estimates in which every representative contributes an Epanechnikov kernel whose bandwidth scales with its own uncertainty, then places cut points exactly where the class-conditional densities intersect. A grid of candidate smoothing parameters is screened using the area under the ROC curve, and the whole procedure runs in time proportional to the number of global representatives times the square of its logarithm.
Whether such compressed cooperation can genuinely stand in for the real thing was tested on ten datasets drawn from the UCI repository, each containing at least ten thousand instances. The data were split into training and test sets; the training portion was discretized once centrally, with full access to every record, and once in federated mode, partitioned among many users each holding only a small local sample. A naive Bayes classifier was then trained on the resulting categorical data, and performance was scored with the area under the receiver operating characteristic curve, a metric suited to both balanced and imbalanced class distributions. Four federated configurations mirrored realistic deployments: ten or one hundred users, each holding fifty or one hundred instances. Every scenario was repeated ten times to capture statistical variability, and the centralized version of each algorithm served as the gold standard against which its federated counterpart was judged.
The verdict was strikingly favorable. The kernel density-based variant matched its centralized counterpart in thirty-three of the forty dataset-and-configuration combinations, or 82.5 percent, with equal-frequency discretization close behind, while the minimalist equal-width method still replicated the gold standard in 67.5 percent of the scenarios. Crucially, even where a federated policy fell short, the drop in AUC relative to centralized discretization never exceeded 0.05, a margin that rarely changes practical conclusions. This robustness held across ten and one hundred users alike, indicating graceful scaling as the federation grows and local fragments shrink. The results also carried an encouraging message about flexibility: because every adapted algorithm consumes a different subset of the representative information, practitioners can trade statistical fidelity against simplicity, and even the crudest option remained within striking distance of what a fully centralized pipeline would achieve.
Formal statistical analysis reinforced the picture. Following standard recommendations for comparing multiple algorithms, the team applied Wilcoxon signed-rank tests at a significance level of 0.05 to every pair of methods, with Shaffer’s static correction for multiple testing. The corrected results found no significant differences between the kernel-based and equal-frequency approaches, nor between the kernel-based and equal-width methods, and pointed to similar behavior between equal-width and entropy-based discretization. In other words, the choice among the four adaptations can be guided by communication budgets and deployment constraints rather than by raw accuracy alone. Supplementary experiments pushed the evaluation into harsher territory: settings where users’ local data distributions are not independently and identically distributed, the scenario that most often degrades federated systems, plus multinomial naive Bayes and tree-augmented naive Bayes classifiers evaluated across five datasets. The discretization scheme proved resilient, withstanding the performance drops typical of such heterogeneity and confirming its versatility across different classifier implementations.
The broader payoff is threefold. Privacy is preserved by construction, since only mixture parameters, never records, cross the network boundary, an arrangement consistent with the standard federated paradigm in which models rather than data are shared. Communication overhead is minimal, because the uplink transmission of representatives happens only once and the server operates on a reduced summary instead of full datasets, an economy that matters when millions of devices or bandwidth-constrained institutions are involved. And the design is deliberately modular: any discretization algorithm, supervised or unsupervised, can in principle be adapted to operate on the representative set, and any classifier that needs categorical inputs can be trained downstream within standard federated machinery. In hospitals, where electronic health records are scattered across institutions that legally cannot pool them, or in industrial plants where sensor streams are dispersed across dozens of controllers, the framework removes a preprocessing bottleneck that has quietly constrained which models federated systems can even attempt. As machine learning pushes deeper into domains where data is sensitive, scattered and stubbornly continuous, work of this kind suggests the gap between centralized and privacy-preserving methods is narrowing toward practical irrelevance.
Subject of Research: A federated discretization framework that learns a shared global discretization policy from Gaussian mixture model representatives in a single communication round, enabling privacy-preserving supervised classification on continuous data.
Subject of Research: Technology and Engineering
Article Title: Federated discretization for supervised classification
Article References: Flores, J. L., Calvo, B., & Pérez, A. (2026). Federated discretization for supervised classification. Data Mining and Knowledge Discovery, 40(5), Article 85. https://doi.org/10.1007/s10618-026-01247-2
Image Credits: AI Generated
DOI: 10.1007/s10618-026-01247-2
Keywords: Federated learning, Discretization, Supervised classification, Gaussian mixture models, Kernel density estimation, Privacy-preserving machine learning, Naive Bayes classifier, Cut points, Communication efficiency, Area under the ROC curve
Cite Scienmag News
APA
MLA
Chicago
Denise Maddox. (August 30, 2026). New federated discretization method enables privacy-preserving supervised classification. Scienmag. https://scienmag.com/new-federated-discretization-method-enables-privacy-preserving-supervised-classification/
Copy citation
Download RIS
Tags: collaborative data categorization techniquescollaborative data discretizationdata privacy in AIdecentralized data preprocessingdistributed classification algorithmsdistributed machine learningedge device data processingedge device machine learningfederated data categorizationfederated data transformationfederated discretizationfederated discretization methodfederated learningfederated learning for discrete datalocal model training without data sharingprivacy-aware AI algorithmsprivacy-aware machine learningprivacy-preserving data analysisprivacy-preserving data discretization methodsprivacy-preserving supervised classificationsecure data categorizationsecure data preprocessingstatistical data summaries in federated learning
