Sciweavers

3702 search results - page 331 / 741
» Reducing Misclassification Costs
Sort
View
JCP
2008
171views more  JCP 2008»
15 years 6 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen
IPM
2006
94views more  IPM 2006»
15 years 6 months ago
Binary Pathfinder: An improvement to the Pathfinder algorithm
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
JSS
2008
93views more  JSS 2008»
15 years 6 months ago
Search-based refactoring for software maintenance
The high cost of software maintenance could be reduced by automatically improving the design of object-oriented programs without altering their behaviour. We have constructed a so...
Mark Kent O'Keeffe, Mel Ó Cinnéide
JSW
2008
99views more  JSW 2008»
15 years 6 months ago
Using Data Mining in MURA Graphic Problems
The MURA phenomenon will result lots of problems in Photomask and TFT-LCD industries as well. In this paper, we designed and developed a MURA related association rules which suitab...
Wen-Hsing Kao, Jason C. Hung, Victoria Hsu
JUCS
2008
138views more  JUCS 2008»
15 years 6 months ago
A Lightweight and Extensible AspectJ Implementation
Abstract: Extending AspectJ to experiment with new language features can be cumbersome, even with an extensible implementation. Often, a language designer only needs a rapid protot...
Rodolfo Toledo, Éric Tanter