Sciweavers

553 search results - page 50 / 111
» A Compress-Based Association Mining Algorithm for Large Data...
Sort
View
ICDIM
2008
IEEE
15 years 4 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
BMCBI
2010
149views more  BMCBI 2010»
14 years 10 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
IJISTA
2008
95views more  IJISTA 2008»
14 years 10 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
14 years 11 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
TEC
2008
104views more  TEC 2008»
14 years 9 months ago
Genetic-Fuzzy Data Mining With Divide-and-Conquer Strategy
Data mining is most commonly used in attempts to induce association rules from transaction data. Most previous studies focused on binary-valued transaction data. Transaction data i...
Tzung-Pei Hong, Chun-Hao Chen, Yeong-Chyi Lee, Yu-...