Sciweavers

2227 search results - page 283 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
143
Voted
FUZZIEEE
2007
IEEE
15 years 9 months ago
Learning Undirected Possibilistic Networks with Conditional Independence Tests
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
Christian Borgelt
CONEXT
2009
ACM
15 years 4 months ago
Where the sidewalk ends: extending the internet as graph using traceroutes from P2P users
An accurate Internet topology graph is important in many areas of networking, from deciding ISP business relationships to diagnosing network anomalies. Most Internet mapping effor...
Kai Chen, David R. Choffnes, Rahul Potharaju, Yan ...
130
Voted
RSFDGRC
2005
Springer
111views Data Mining» more  RSFDGRC 2005»
15 years 9 months ago
Feature Selection with Adjustable Criteria
Abstract. We present a study on a rough set based approach for feature selection. Instead of using significance or support, Parameterized Average Support Heuristic (PASH) consider...
Jingtao Yao, Ming Zhang
130
Voted
SDM
2007
SIAM
149views Data Mining» more  SDM 2007»
15 years 4 months ago
WAT: Finding Top-K Discords in Time Series Database
Finding discords in time series database is an important problem in a great variety of applications, such as space shuttle telemetry, mechanical industry, biomedicine, and financ...
Yingyi Bu, Oscar Tat-Wing Leung, Ada Wai-Chee Fu, ...
159
Voted
KDD
2012
ACM
244views Data Mining» more  KDD 2012»
13 years 6 months ago
Open domain event extraction from twitter
Tweets are the most up-to-date and inclusive stream of information and commentary on current events, but they are also fragmented and noisy, motivating the need for systems that c...
Alan Ritter, Mausam, Oren Etzioni, Sam Clark