Sciweavers

254 search results - page 29 / 51
» New resampling method for evaluating stability of clusters
Sort
View
IJCAI
2007
13 years 9 months ago
Semantic Smoothing of Document Models for Agglomerative Clustering
In this paper, we argue that the agglomerative clustering with vector cosine similarity measure performs poorly due to two reasons. First, the nearest neighbors of a document belo...
Xiaohua Zhou, Xiaodan Zhang, Xiaohua Hu
ICML
2007
IEEE
14 years 8 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 1 months ago
BER Analysis in A Generalized UWB Frequency Selective Fading Channel With Randomly Arriving Clusters and Rays
— In this paper, we present an analytical method to evaluate the bit error rate (BER) of the ultra-wideband (UWB) system in the IEEE 802.15.4a standardized channel model. The IEE...
Wei-Cheng Liu, Li-Chun Wang
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 1 months ago
A Scalable Collaborative Filtering Framework Based on Co-Clustering
Collaborative filtering-based recommender systems, which automatically predict preferred products of a user using known preferences of other users, have become extremely popular ...
Thomas George, Srujana Merugu
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 5 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...