Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Cluster Sampling Method

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...

Sampling Plans

Sampling Plans

Sampling is a crucial step in analytical chemistry, allowing researchers to collect representative data from a large population. Common sampling methods include random, judgmental, systematic, stratified, and cluster sampling.
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...

Information Processing Approach

Information Processing Approach

The information-processing theory of cognitive development centers on fundamental mental processes, including attention, memory, and problem-solving skills. Researchers in this field examine how cognitive abilities, such as working memory, evolve and influence children's overall development. Studies indicate that children with stronger working memory tend to excel in reading comprehension, math, and problem-solving compared to peers with less efficient memory skills. Low working memory is also...

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

Pharmacokinetic models are mathematical constructs that represent and predict the time course of drug concentrations in the body, providing meaningful pharmacokinetic parameters. These models are categorized into compartment, physiological, and distributed parameter models.
The distributed parameter models are specifically designed to account for variations and differences in some drug classes. This model is particularly useful for assessing regional concentrations of anticancer or...

Hückel's Rule Diagram of π MOs: Frost Circle

Hückel's Rule Diagram of π MOs: Frost Circle

The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so that...

You might also read

Related Articles

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

Sort by

Same author

Study of χ_{bJ}(2P)→ωϒ(1S) at Belle.

Physical review letters·2025

Same author

Multi-omics uncover acute stress vulnerability through gut-hypothalamic communication in ducks.

British poultry science·2025

Same author

Measurement of CP Asymmetries in B^{0}→K_{S}^{0}π^{0}γ Decays at Belle II.

Physical review letters·2025

Same author

Evidence of h_{b}(2P)→ϒ(1S)η Decay and Search for h_{b}(1P,2P)→ϒ(1S)π^{0} with the Belle Detector.

Physical review letters·2025

Same author

Measurement of Angular Coefficients of B[over ¯]→D^{*}ℓν[over ¯]_{ℓ}: Implications for |V_{cb}| and Tests of Lepton Flavor Universality.

Physical review letters·2024

Same author

Search for Rare b→dℓ^{+}ℓ^{-} Transitions at Belle.

Physical review letters·2024

Search research articles

Related Experiment Videos

A loose-pattern process approach to clustering fuzzy data sets.

T Gu¹, B Dubuisson

¹University of Technology of Compiegne, 60206 Compiegne Cedex, France.

IEEE Transactions on Pattern Analysis and Machine Intelligence

|August 27, 2011

Summary

This summary is machine-generated.

This study introduces a novel loose-pattern process for set clustering, utilizing nearest neighbor rules and heuristic functions. Experiments demonstrate its effectiveness in classifying and assigning data points to clusters.

Related Experiment Videos

Area of Science:

Data Science
Computer Science
Machine Learning

Background:

Clustering algorithms are essential for data analysis.
Existing methods may struggle with complex or loosely defined patterns.
A need exists for flexible clustering approaches.

Purpose of the Study:

To present a new loose-pattern process approach for clustering sets.
To introduce two novel tight-pattern clustering methods: GLC and OUPIC.
To evaluate the effectiveness of the proposed loose-pattern assigning classes method.

Main Methods:

Loose-pattern rejection based on q-nearest neighbors.
Tight-pattern classification using GLC and OUPIC methods.
Loose-pattern class assignment guided by a heuristic membership function.

Main Results:

The loose-pattern rejection effectively filters data points.
GLC and OUPIC demonstrated robust tight-pattern classification.
The heuristic membership function showed promise in assigning classes.

Conclusions:

The proposed loose-pattern process offers a flexible framework for set clustering.
The integration of nearest neighbor rules and heuristic functions enhances clustering accuracy.
Further research can explore broader applications and optimizations.