Sciweavers

1013 search results - page 126 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
WWW
2011
ACM
13 years 4 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
ISEMANTICS
2010
13 years 10 months ago
Foundations of data interoperability on the web: a web science perspective
In this paper, when we use the term ontology, we are primarily referring to linked data in the form of RDF(S). The problem of ontology mapping has attracted considerable attention...
Hamid Haidarian Shahri
NAR
1998
161views more  NAR 1998»
13 years 8 months ago
Touring protein fold space with Dali/FSSP
The FSSP database and its new supplement, the Dali Domain Dictionary, present a continuously updated classification of all known 3D protein structures. The classification is deriv...
Liisa Holm, Chris Sander
ENGL
2007
101views more  ENGL 2007»
13 years 9 months ago
Multiresolution Knowledge Mining using Wavelet Transform
— Most research in Knowledge Mining deal with the basic models like clustering, classification, regression, association rule mining and so on. In the process of quest for knowled...
R. Pradeep Kumar, P. Nagabhushan
BMCBI
2010
152views more  BMCBI 2010»
13 years 9 months ago
Comparative study of discretization methods of microarray data for inferring transcriptional regulatory networks
Background: Microarray data discretization is a basic preprocess for many algorithms of gene regulatory network inference. Some common discretization methods in informatics are us...
Yong Li, Lili Liu, Xi Bai, Hua Cai, Wei Ji, Dianji...