Linear Separability

From GM-RKB
(Redirected from Linear separability)
Jump to navigation Jump to search

Linear Separability is a geometric property between two sets of points on the Euclidean Space .

References

2015

  • (Wikipedia, 2016) ⇒ http://wikipedia.org/wiki/Linear_separability
    • QUOTE: In Euclidean geometry, linear separability is a geometric property of a pair of sets of points. This is most easily visualized in two dimensions (the Euclidean plane) by thinking of one set of points as being colored blue and the other set of points as being colored red. These two sets are linearly separable if there exists at least one line in the plane with all of the blue points on one side of the line and all the red points on the other side. This idea immediately generalizes to higher-dimensional Euclidean spaces if line is replaced by hyperplane.
The problem of determining if a pair of sets is linearly separable and finding a separating hyperplane if they are arises in several areas. In statistics and machine learning, classifying certain types of data is a problem for which good algorithms exist that are based on this concept.
Mathematic Definition
Let [math]\displaystyle{ X_{0} }[/math] and [math]\displaystyle{ X_{1} }[/math] be two sets of points in an n-dimensional Euclidean space. Then [math]\displaystyle{ X_{0} }[/math] and [math]\displaystyle{ X_{1} }[/math] are linearly separable if there exists n + 1 real numbers [math]\displaystyle{ w_{1}, w_{2},..,w_{n}, k }[/math], such that every point [math]\displaystyle{ x \in X_{0} }[/math] satisfies [math]\displaystyle{ \sum^{n}_{i=1} w_{i}x_{i} \gt k }[/math] and every point [math]\displaystyle{ x \in X_{1} }[/math] satisfies [math]\displaystyle{ \sum^{n}_{i=1} w_{i}x_{i} \lt k }[/math], where [math]\displaystyle{ x_{i} }[/math] is the [math]\displaystyle{ i }[/math]-th component of [math]\displaystyle{ x }[/math]

2006

2011

1965

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Linear_Separability&oldid=881162"