Sciweavers

176 search results - page 33 / 36
» Discovering and ranking important rules
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 3 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
TMC
2008
120views more  TMC 2008»
13 years 9 months ago
Mitigating Performance Degradation in Congested Sensor Networks
Data generated in wireless sensor networks may not all be alike: some data may be more important than others and hence may have different delivery requirements. In this paper, we a...
Raju Kumar, Riccardo Crepaldi, Hosam Rowaihy, Albe...
INFOCOM
2009
IEEE
14 years 4 months ago
Distilling Superior Peers in Large-Scale P2P Streaming Systems
Abstract—In large-scale peer-to-peer (P2P) live streaming systems with a limited supply of server bandwidth, increasing the amount of upload bandwidth supplied by peers becomes c...
Zimu Liu, Chuan Wu, Baochun Li, Shuqiao Zhao
AIIA
2007
Springer
14 years 4 months ago
A Hierarchical Clustering Procedure for Semantically Annotated Resources
Abstract. A clustering method is presented which can be applied to relational knowledge bases. It can be used to discover interesting groupings of resources through their (semantic...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
ANOR
2005
131views more  ANOR 2005»
13 years 9 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas