Sciweavers

9611 search results - page 278 / 1923
» A Note on Difference Sets
Sort
View
SDM
2008
SIAM
168views Data Mining» more  SDM 2008»
15 years 8 months ago
Semi-Supervised Clustering via Matrix Factorization
The recent years have witnessed a surge of interests of semi-supervised clustering methods, which aim to cluster the data set under the guidance of some supervisory information. U...
Fei Wang, Tao Li, Changshui Zhang
KDID
2004
134views Database» more  KDID 2004»
15 years 8 months ago
Theoretical Bounds on the Size of Condensed Representations
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
Nele Dexters, Toon Calders
138
Voted
ARSCOM
2008
65views more  ARSCOM 2008»
15 years 6 months ago
On the non-existence of a maximal partial spread of size 76 in PG(3, 9)
We prove the non-existence of maximal partial spreads of size 76 in PG(3, 9). Relying on the classification of the minimal blocking sets of size 15 in PG(2, 9) [22], we show that ...
Olof Heden, Stefano Marcugini, Fernanda Pambianco,...
CORR
2008
Springer
87views Education» more  CORR 2008»
15 years 6 months ago
Two-Level Concept-Oriented Data Model
In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion...
Alexandr A. Savinov
DM
2006
66views more  DM 2006»
15 years 6 months ago
On the role of hypercubes in the resonance graphs of benzenoid graphs
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perfect matchings being adjacent13 if their symmetric difference forms the edge set...
Khaled Salem, Sandi Klavzar, Ivan Gutman