equivalence class


Also found in: Wikipedia.

equivalence class

(mathematics)
An equivalence class is a subset whose elements are related to each other by an equivalence relation. The equivalence classes of a set under some relation form a partition of that set (i.e. any two are either equal or disjoint and every element of the set is in some class).
References in periodicals archive ?
If a set of N stimuli that bear no resemblance to each other all become related to each other, they are acting as members of an equivalence class (Fields & Verhave, 1987; Sidman, 1994; Sidman & Tailby, 1982).
These three properties document the formation of an equivalence class among stimuli, A, B, and C (Sidman 1994).
Equivalence class formation in language-able and language-disabled children.
Next, we discuss two important classes of SRCTs that will form special representatives of each equivalence class.
Similarity attack can occur when equivalence class contains distinct but semantically similar values for sensitive attribute.
Without additional training or explicit reinforcement, the subject may derive other relations among the stimuli; therefore the stimuli are said to be members of an equivalence class, and they show the properties of reflexivity, symmetry and transitivity.
A connected component is finally identified as the set of pixels belonging to the same equivalence class of labels.
During testing for equivalence class formation, a novel stimulus, a female occupation, was included among the male occupation stimuli.
The above said methods are laborious and do not provide us with exact procedures to automate the process of equivalence class generation that play an important role in the design of a Rough Set Information Retrieval Systems.
To derive fuzzy classes from sharp contexts, the qualifying attributes are considered as linguistic variables, and verbal terms are assigned to each equivalence class.
The symmetries in this definition allow for a natural equivalence class structure, as was shown for Fornasier's intrinsically localized frames in [13].
In the second phase, the PA algorithm recursively scans the body of text for "significant patterns" that consist of a sequence of graph edges (words that follow each other to form common phrases, such as "book a" in the example), an equivalence class of vertices (first-class, direct and economy), and a terminating sequence of graph edges (flight).