Sciweavers

2297 search results - page 6 / 460
» An Algorithm for Computing the Integral Closure
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
Partial closure-based constrained clustering with order ranking
In this paper we propose a new partial closure-based constrained clustering algorithm. We introduce closures into the partial constrained clustering and we propose a new measureme...
Shaohong Zhang, Hau-San Wong
DIS
2008
Springer
13 years 10 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
DKE
2002
218views more  DKE 2002»
13 years 8 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
AAAI
2010
13 years 8 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
DIS
2004
Springer
14 years 11 days ago
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Ari...