Sciweavers

19 search results - page 3 / 4
» Revealing Class Structure with Concept Lattices
Sort
View
DM
2007
84views more  DM 2007»
13 years 8 months ago
Matroids on convex geometries (cg-matroids)
We consider matroidal structures on convex geometries, which we call cg-matroids. The concept of a cg-matroid is closely related to but different from that of a supermatroid intro...
Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano
BIRTHDAY
2008
Springer
13 years 10 months ago
Models of Computation: A Tribute to Ugo Montanari's Vision
e [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. It presented severa...
Roberto Bruni, Vladimiro Sassone
ISAAC
2010
Springer
272views Algorithms» more  ISAAC 2010»
13 years 6 months ago
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship...
Akiyoshi Shioura
KAIS
2007
75views more  KAIS 2007»
13 years 8 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
CPAIOR
2006
Springer
14 years 8 days ago
Duality in Optimization and Constraint Satisfaction
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
John N. Hooker