Sciweavers

571 search results - page 32 / 115
» Testing homogeneity of a large data set by bootstrapping
Sort
View
NIPS
2003
15 years 1 months ago
Unsupervised Context Sensitive Language Acquisition from a Large Corpus
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...
Zach Solan, David Horn, Eytan Ruppin, Shimon Edelm...
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 5 days ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
BMCBI
2008
114views more  BMCBI 2008»
14 years 12 months ago
Testing the Coulomb/Accessible Surface Area solvent model for protein stability, ligand binding, and protein design
Background: Protein structure prediction and computational protein design require efficient yet sufficiently accurate descriptions of aqueous solvent. We continue to evaluate the ...
Marcel Schmidt am Busch, Anne Lopes, Najette Amara...
ICDM
2008
IEEE
107views Data Mining» more  ICDM 2008»
15 years 6 months ago
GeoDMA - A Novel System for Spatial Data Mining
Although a huge amount of remote sensing data has been provided by Earth observation satellites, few data manipulation techniques and information extraction in large data sets hav...
Thales Sehn Korting, Leila Maria Garcia Fonseca, M...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 5 days ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han