Sciweavers

315 search results - page 49 / 63
» Data Mining Algorithms to Classify Students
Sort
View
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
16 years 3 months ago
Discriminative Frequent Pattern Analysis for Effective Classification
The application of frequent patterns in classification appeared in sporadic studies and achieved initial success in the classification of relational data, text documents and graph...
Hong Cheng, Xifeng Yan, Jiawei Han, Chih-Wei Hsu
MSR
2010
ACM
15 years 7 months ago
A comparative exploration of FreeBSD bug lifetimes
—In this paper, we explore the viability of mining the basic data provided in bug repositories to predict bug lifetimes. We follow the method of Lucas D. Panjer as described in h...
Gargi Bougie, Christoph Treude, Daniel M. Germ&aac...
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
16 years 2 months ago
Why collective inference improves relational classification
Procedures for collective inference make simultaneous statistical judgments about the same variables for a set of related data instances. For example, collective inference could b...
David Jensen, Jennifer Neville, Brian Gallagher
IDA
2002
Springer
15 years 1 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
15 years 7 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su