Sciweavers

4560 search results - page 43 / 912
» Finding Data in the Neighborhood
Sort
View
KDD
2009
ACM
208views Data Mining» more  KDD 2009»
14 years 8 months ago
A principled and flexible framework for finding alternative clusterings
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
Zijie Qi, Ian Davidson
ICDE
2000
IEEE
96views Database» more  ICDE 2000»
14 years 9 months ago
Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani
ICPR
2008
IEEE
14 years 2 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...
ADBIS
2007
Springer
145views Database» more  ADBIS 2007»
14 years 2 months ago
A Method for Comparing Self-organizing Maps: Case Studies of Banking and Linguistic Data
The method of self-organizing maps (SOM) is a method of exploratory data analysis used for clustering and projecting multi-dimensional data into a lower-dimensional space to reveal...
Toomas Kirt, Ene Vainik, Leo Vohandu
TMI
2002
185views more  TMI 2002»
13 years 7 months ago
A modified fuzzy c-means algorithm for bias field estimation and segmentation of MRI data
In this paper, we present a novel algorithm for fuzzy segmentation of magnetic resonance imaging (MRI) data and estimation of intensity inhomogeneities using fuzzy logic. MRI inten...
Mohamed N. Ahmed, Sameh M. Yamany, Nevin Mohamed, ...