Sciweavers

767 search results - page 116 / 154
» On Clustering Using Random Walks
Sort
View
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 7 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
ACMSE
2005
ACM
14 years 1 months ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan
IMC
2006
ACM
14 years 1 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
AUSAI
2007
Springer
14 years 1 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
GIS
2008
ACM
14 years 8 months ago
Data mining for visual exploration and detection of ecosystem disturbances
This paper presents a case study on the application of data mining to the problem of detecting ecosystem disturbances from vegetation cover data obtained from satellite observatio...
Haibin Cheng, Pang-Ning Tan, Christopher Potter, S...