Sciweavers

3146 search results - page 281 / 630
» Efficient Consequence Finding
Sort
View
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 7 months ago
Markov Blankets and Meta-heuristics Search: Sentiment Extraction from Unstructured Texts
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
Edoardo Airoldi, Xue Bai, Rema Padman
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
16 years 7 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
16 years 7 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
16 years 7 months ago
Identifying non-actionable association rules
Building predictive models and finding useful rules are two important tasks of data mining. While building predictive models has been well studied, finding useful rules for action...
Bing Liu, Wynne Hsu, Yiming Ma
281
Voted
VLDB
2001
ACM
157views Database» more  VLDB 2001»
16 years 7 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy