Sciweavers

100 search results - page 2 / 20
» Distributed Algorithm for Computing Formal Concepts Using Ma...
Sort
View
SAC
2010
ACM
14 years 8 days ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
ICDE
2012
IEEE
267views Database» more  ICDE 2012»
11 years 7 months ago
Scalable and Numerically Stable Descriptive Statistics in SystemML
—With the exponential growth in the amount of data that is being generated in recent years, there is a pressing need for applying machine learning algorithms to large data sets. ...
Yuanyuan Tian, Shirish Tatikonda, Berthold Reinwal...
GCC
2003
Springer
13 years 10 months ago
Modeling Distributed Algorithm Using B
Although there have been several attempts to create grid systems, there is no clear definition for grids. In this paper, a formal approach is presented for defining elementary func...
Shengrong Zou
SOSP
2009
ACM
14 years 2 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
ICFCA
2009
Springer
13 years 10 months ago
Handling Large Formal Context Using BDD - Perspectives and Limitations
This paper presents Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts. The main id...
Andrei Rimsa, Luis E. Zárate, Mark A. J. So...