Sciweavers

234 search results - page 25 / 47
» Rough Set Approximations in Formal Concept Analysis
Sort
View
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
11 years 10 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
ICFCA
2009
Springer
14 years 2 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
ATAL
1997
Springer
13 years 12 months ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche
ISCI
2010
96views more  ISCI 2010»
13 years 6 months ago
Multi-adjoint t-concept lattices
The t-concept lattice is introduced as a set of triples associated to graded tabular information interpreted in a non-commutative fuzzy logic. Following the general techniques of ...
Jesús Medina, Manuel Ojeda-Aciego
IPL
2007
96views more  IPL 2007»
13 years 7 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...