Sciweavers

1458 search results - page 94 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
ICCAD
2006
IEEE
108views Hardware» more  ICCAD 2006»
16 years 2 months ago
Formal model of data reuse analysis for hierarchical memory organizations
– In real-time data-dominated communication and multimedia processing applications, due to the manipulation of large sets of data, a multi-layer memory hierarchy is used to enhan...
Ilie I. Luican, Hongwei Zhu, Florin Balasa
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 5 months ago
Markov Blankets and Meta-heuristics Search: Sentiment Extraction from Unstructured Texts
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
Edoardo Airoldi, Xue Bai, Rema Padman
AAAI
2006
15 years 6 months ago
When Is Constrained Clustering Beneficial, and Why?
Several researchers have illustrated that constraints can improve the results of a variety of clustering algorithms. However, there can be a large variation in this improvement, e...
Kiri Wagstaff, Sugato Basu, Ian Davidson
ICDM
2008
IEEE
102views Data Mining» more  ICDM 2008»
15 years 11 months ago
Mining Order-Preserving Submatrices from Data with Repeated Measurements
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...
Chun Kit Chui, Ben Kao, Kevin Y. Yip, Sau Dan Lee
BMCBI
2006
170views more  BMCBI 2006»
15 years 5 months ago
Biclustering of gene expression data by non-smooth non-negative matrix factorization
Background: The extended use of microarray technologies has enabled the generation and accumulation of gene expression datasets that contain expression levels of thousands of gene...
Pedro Carmona-Saez, Roberto D. Pascual-Marqui, Fra...