Sciweavers

443 search results - page 75 / 89
» More on the Size of Higman-Haines Sets: Effective Constructi...
Sort
View
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
13 years 11 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
NIPS
2008
13 years 9 months ago
On the Reliability of Clustering Stability in the Large Sample Regime
Clustering stability is an increasingly popular family of methods for performing model selection in data clustering. The basic idea is that the chosen model should be stable under...
Ohad Shamir, Naftali Tishby
PLANX
2007
13 years 9 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
13 years 11 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
ICHIM
2001
121views more  ICHIM 2001»
13 years 9 months ago
From Dust to Stardust: A Collaborative 3D Virtual Museum of Computer Science
One of the outcomes of Moore's Law - according to which the exponential growth of technical advances in computer science is pushing more and more of our computers into obsole...
Thimoty Barbieri, Franca Garzotto, Giovanni Beltra...