Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
Mechanistic Models: Compartment Models in Individual and Population Analysis01:23

Mechanistic Models: Compartment Models in Individual and Population Analysis

Mechanistic models are utilized in individual analysis using single-source data, but imperfections arise due to data collection errors, preventing perfect prediction of observed data. The mathematical equation involves known values (Xi), observed concentrations (Ci), measurement errors (εi), model parameters (ϕj), and the related function (ƒi) for i number of values. Different least-squares metrics quantify differences between predicted and observed values. The ordinary least squares (OLS)...
Chunking01:12

Chunking

Chunking is a powerful cognitive technique that improves short-term memory retention by organizing information into smaller, more manageable units. The brain, limited by working memory capacity, can more easily process and store information when it is divided into "chunks" rather than presented as discrete, unrelated elements. Chunking is especially useful when dealing with large amounts of information, such as numerical sequences, words, or complex ideas.
The principle behind chunking is...
Constraints and Statical Determinacy01:26

Constraints and Statical Determinacy

In structural engineering, the equilibrium of a system is not only determined by its equations of equilibrium but also with the help of constraints. Constraints refer to restrictions on the motion of a system. The proper combinations of constraints can minimize the total number of constraints needed to maintain a system in mechanical equilibrium. When this happens, the system is said to be statically determinate. For such systems, the unknown reaction supports can be estimated using equilibrium...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The Hierarchical Discrete Pursuit Learning Automaton: A Novel Scheme With Fast Convergence and Epsilon-Optimality.

IEEE transactions on neural networks and learning systems·2023
Same author

Solving Two-Person Zero-Sum Stochastic Games With Incomplete Information Using Learning Automata With Artificial Barriers.

IEEE transactions on neural networks and learning systems·2021
Same author

Factorial Investigation of Cobalt Retention by Ti and Fe Oxides-Modified Carbon Nanotubes: Multivariate Against Univariate Analysis.

Frontiers in chemistry·2021
Same author

Achieving Fair Load Balancing by Invoking a Learning Automata-Based Two-Time-Scale Separation Paradigm.

IEEE transactions on neural networks and learning systems·2020
Same author

The Hierarchical Continuous Pursuit Learning Automation: A Novel Scheme for Environments With Large Numbers of Actions.

IEEE transactions on neural networks and learning systems·2019
Same author

A Conclusive Analysis of the Finite-Time Behavior of the Discretized Pursuit Learning Automaton.

IEEE transactions on neural networks and learning systems·2019
Same journal

Strategic Ability Updating in Concurrent Games by Coalitional Commitment.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2015
Same journal

Meta-Analysis of the First Facial Expression Recognition Challenge.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012
Same journal

Adjustable model-based fusion method for multispectral and panchromatic images.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012
Same journal

Face Feature Weighted Fusion Based on Fuzzy Membership Degree for Video Face Recognition.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012
Same journal

A New Adaptive Fast Cellular Automaton Neighborhood Detection and Rule Identification Algorithm.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012
Same journal

Human-arm-and-hand-dynamic model with variability analyses for a stylus-based haptic interface.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012
See all related articles

Related Experiment Video

Updated: Jun 24, 2026

Automatic Image Processing to Determine the Community Size Structure of Riverine Macroinvertebrates
08:56

Automatic Image Processing to Determine the Community Size Structure of Riverine Macroinvertebrates

Published on: January 13, 2023

Achieving microaggregation for secure statistical databases using fixed-structure partitioning-based learning

Ebaa Fayyoumi1, B John Oommen

  • 1School of Computer Science, Carleton University, Ottawa, ON, Canada. efayyoum@scs.carleton.ca

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society
|April 2, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a novel learning automata approach for the microaggregation problem (MAP). The method effectively reduces information loss and enhances the trade-off between information loss and disclosure risk in data partitioning.

More Related Videos

Automating Aggregate Quantification in Caenorhabditis elegans
07:50

Automating Aggregate Quantification in Caenorhabditis elegans

Published on: October 14, 2021

Related Experiment Videos

Last Updated: Jun 24, 2026

Automatic Image Processing to Determine the Community Size Structure of Riverine Macroinvertebrates
08:56

Automatic Image Processing to Determine the Community Size Structure of Riverine Macroinvertebrates

Published on: January 13, 2023

Automating Aggregate Quantification in Caenorhabditis elegans
07:50

Automating Aggregate Quantification in Caenorhabditis elegans

Published on: October 14, 2021

Area of Science:

  • Data privacy and security
  • Statistical data analysis
  • Machine learning applications

Background:

  • The microaggregation problem (MAP) is crucial for data anonymization, aiming to partition records while minimizing information loss.
  • MAP is NP-hard, necessitating efficient heuristic solutions for practical data privacy.
  • Existing methods often struggle to balance information loss (IL) and disclosure risk (DR).

Purpose of the Study:

  • To present the first fixed-structure-stochastic-automata-based solution for the microaggregation problem.
  • To evaluate the proposed method's performance against state-of-the-art techniques.
  • To demonstrate the effectiveness of learning automata in optimizing the IL-DR trade-off.

Main Methods:

  • Implementation of a novel fixed-structure-stochastic-automata algorithm.
  • Application of the algorithm to real-life and simulated datasets.
  • Comparative analysis of the proposed method with existing heuristic solutions based on IL, DR, and a scoring index.

Main Results:

  • The learning automata-based method achieved a lower information loss (IL) compared to existing approaches.
  • A superior trade-off between information loss and disclosure risk (DR) was observed.
  • The proposed method demonstrated a better scoring index, integrating both IL and DR.

Conclusions:

  • Learning automata are applicable and effective for solving the microaggregation problem.
  • The developed scheme provides an improved balance between data utility (IL) and privacy protection (DR).
  • This approach offers a promising direction for enhancing data anonymization techniques.