Sciweavers

4781 search results - page 118 / 957
» Complexity at large
Sort
View
BMCBI
2008
186views more  BMCBI 2008»
13 years 10 months ago
Variable selection for large p small n regression models with incomplete data: Mapping QTL with epistases
Background: Identifying quantitative trait loci (QTL) for both additive and epistatic effects raises the statistical issue of selecting variables from a large number of candidates...
Min Zhang, Dabao Zhang, Martin T. Wells
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
14 years 10 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 10 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
AIRWEB
2009
Springer
14 years 4 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
SIGSOFT
2005
ACM
14 years 3 months ago
PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code
Programs usually follow many implicit programming rules, most of which are too tedious to be documented by programmers. When these rules are violated by programmers who are unawar...
Zhenmin Li, Yuanyuan Zhou