Sciweavers

1565 search results - page 178 / 313
» cluster 2006
Sort
View
IWC
2002
121views more  IWC 2002»
14 years 9 months ago
Discovering user communities on the Internet using unsupervised machine learning techniques
Interest in the analysis of user behaviour on the Internet has been increasing rapidly, especially since the advent of electronic commerce. In this context, we argue here for the ...
Georgios Paliouras, Christos Papatheodorou, Vangel...
PRL
2002
67views more  PRL 2002»
14 years 9 months ago
A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets
Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false result...
Xiaolu Huang, Qiuming Zhu
NAR
2007
122views more  NAR 2007»
14 years 9 months ago
The Online Bioinformatics Resources Collection at the University of Pittsburgh Health Sciences Library System - a one-stop gatew
To bridge the gap between the rising information needs of biological and medical researchers and the rapidly growing number of online bioinformatics resources, we have created the...
Yi-Bu Chen, Ansuman Chattopadhyay, Phillip Bergen,...
IJMC
2010
139views more  IJMC 2010»
14 years 8 months ago
A realistic mobility model for wireless networks of scale-free node connectivity
: Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free powerlaw connectivity distribution and a few densely po...
Sunho Lim, Chansu Yu, Chita R. Das
MST
2010
98views more  MST 2010»
14 years 8 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...