Sciweavers

1290 search results - page 166 / 258
» Agent-Enriched Data Mining Using an Extendable Framework
Sort
View
DATAMINE
2006
89views more  DATAMINE 2006»
14 years 9 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
KDID
2004
132views Database» more  KDID 2004»
14 years 11 months ago
An Automata Approach to Pattern Collections
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
CORR
2010
Springer
200views Education» more  CORR 2010»
14 years 9 months ago
A Multilevel Approach For Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
Nicolas Gillis, François Glineur
GLOBECOM
2010
IEEE
14 years 7 months ago
PRO: A Profile-Based Routing Protocol for Pocket Switched Networks
In this paper, we propose a novel routing protocol, PRO, for profile-based routing in pocket switched networks. Differing from previous routing protocols, PRO treats node encounter...
Murat Ali Bayir, Murat Demirbas
EMNLP
2009
14 years 7 months ago
Reverse Engineering of Tree Kernel Feature Spaces
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
Daniele Pighin, Alessandro Moschitti