Sciweavers

2600 search results - page 212 / 520
» Clustering with or without the Approximation
Sort
View
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 4 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ICONIP
2009
15 years 4 months ago
Text Mining with an Augmented Version of the Bisecting K-Means Algorithm
There is an ever increasing number of electronic documents available today and the task of organizing and categorizing this ever growing corpus of electronic documents has become t...
Yutaro Hatagami, Toshihiko Matsuka
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
16 years 8 months ago
Using XML to Build Efficient Transaction-Time Temporal Database Systems on Relational Databases
In this paper, we present the ArchIS system that achieves full-functionality transaction-time databases without requiring temporal extensions in XML or database standards. ArchIS&...
Fusheng Wang, Xin Zhou, Carlo Zaniolo
ISBI
2004
IEEE
16 years 7 months ago
Detection of Functional Networks In The Resting Brain
Recently, increasing attention has focused on exploring brain activity during rest. A current challenge is to ascertain activity patterns without using an external reference. In t...
Yong He, Yufeng Zang, Tianzi Jiang, Yingli Lu, Xuc...
ICPR
2008
IEEE
16 years 1 months ago
A supervised learning approach for imbalanced data sets
This paper presents a new learning approach for pattern classification applications involving imbalanced data sets. In this approach, a clustering technique is employed to resamp...
Giang Hoang Nguyen, Abdesselam Bouzerdoum, Son Lam...