Sciweavers

184 search results - page 30 / 37
» Two New Criteria for Comparison in the Bruhat Order
Sort
View
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
14 years 6 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
PODS
2008
ACM
128views Database» more  PODS 2008»
14 years 6 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
ICDM
2010
IEEE
142views Data Mining» more  ICDM 2010»
13 years 4 months ago
Causal Discovery from Streaming Features
In this paper, we study a new research problem of causal discovery from streaming features. A unique characteristic of streaming features is that not all features can be available ...
Kui Yu, Xindong Wu, Hao Wang, Wei Ding
ACL
2007
13 years 8 months ago
A Seed-driven Bottom-up Machine Learning Framework for Extracting Relations of Various Complexity
A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as...
Feiyu Xu, Hans Uszkoreit, Hong Li
SDM
2010
SIAM
184views Data Mining» more  SDM 2010»
13 years 8 months ago
A Robust Decision Tree Algorithm for Imbalanced Data Sets
We propose a new decision tree algorithm, Class Confidence Proportion Decision Tree (CCPDT), which is robust and insensitive to class distribution and generates rules which are st...
Wei Liu, Sanjay Chawla, David A. Cieslak, Nitesh V...