Sciweavers

1662 search results - page 227 / 333
» Characterizing the generalization performance of model selec...
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 6 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
BMCBI
2006
139views more  BMCBI 2006»
15 years 6 months ago
DNA Molecule Classification Using Feature Primitives
Background: We present a novel strategy for classification of DNA molecules using measurements from an alpha-Hemolysin channel detector. The proposed approach provides excellent c...
Raja Tanveer Iqbal, Matthew Landry, Stephen Winter...
BMCBI
2005
131views more  BMCBI 2005»
15 years 6 months ago
Regularized Least Squares Cancer Classifiers from DNA microarray data
Background: The advent of the technology of DNA microarrays constitutes an epochal change in the classification and discovery of different types of cancer because the information ...
Nicola Ancona, Rosalia Maglietta, Annarita D'Addab...
TKDE
1998
122views more  TKDE 1998»
15 years 6 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
DEXA
1995
Springer
126views Database» more  DEXA 1995»
15 years 10 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek