Sciweavers

7150 search results - page 442 / 1430
» Graph-Based Data Mining
Sort
View
TKDE
2008
139views more  TKDE 2008»
15 years 6 months ago
Mining Weighted Association Rules without Preassigned Weights
Association rule mining is a key issue in data mining. However, the classical models ignore the difference between the transactions, and the weighted association rule mining does n...
Ke Sun, Fengshan Bai
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
15 years 11 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
COSIT
2009
Springer
165views GIS» more  COSIT 2009»
16 years 1 months ago
To Be and Not To Be: 3-Valued Relations on Graphs
Spatial information requires models which allow us to answer ‘maybe’ to questions asking whether a location lies within a region. At the same time, models must account for data...
John G. Stell
ER
2007
Springer
127views Database» more  ER 2007»
16 years 1 months ago
Update XML Data by Using Graphical Languages
To be a full-featured data exchange format, XML should support not only queries but also updates on its contents. The new W3C XML update facility has proposed a set of operators (...
Wei Ni, Tok Wang Ling
INFOCOM
2009
IEEE
16 years 1 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...