Sciweavers

4536 search results - page 183 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
FIMI
2003
88views Data Mining» more  FIMI 2003»
13 years 11 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon
CIKM
2009
Springer
14 years 4 months ago
Potential collaboration discovery using document clustering and community structure detection
Complex network analysis is a growing research area in a wide variety of domains and has recently become closely associated with data, text and web mining. One of the most active ...
Cristian Klen dos Santos, Alexandre Evsukoff, Beat...
CVPR
2004
IEEE
14 years 11 months ago
Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
Kun Huang, René Vidal, Yi Ma
SSPR
2004
Springer
14 years 3 months ago
Kernel Methods for Exploratory Pattern Analysis: A Demonstration on Text Data
Kernel Methods are a class of algorithms for pattern analysis with a number of convenient features. They can deal in a uniform way with a multitude of data types and can be used to...
Tijl De Bie, Nello Cristianini
BMCBI
2010
148views more  BMCBI 2010»
13 years 9 months ago
Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
Mara L. Hartsperger, Florian Blöchl, Volker S...