Sciweavers

614 search results - page 9 / 123
» Structuring Knowledge for Reference Generation: A Clustering...
Sort
View
ICAISC
2010
Springer
13 years 7 months ago
Pruning Classification Rules with Reference Vector Selection Methods
Attempts to extract logical rules from data often lead to large sets of classification rules that need to be pruned. Training two classifiers, the C4.5 decision tree and the Non-Ne...
Karol Grudzinski, Marek Grochowski, Wlodzislaw Duc...
PKDD
2007
Springer
102views Data Mining» more  PKDD 2007»
14 years 1 months ago
Towards Data Mining Without Information on Knowledge Structure
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
Alexandre Vautier, Marie-Odile Cordier, Rene Quini...
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
13 years 5 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
DAWAK
1999
Springer
13 years 11 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
SYNASC
2006
IEEE
106views Algorithms» more  SYNASC 2006»
14 years 1 months ago
A Quality Measure for Multi-Level Community Structure
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
Maylis Delest, Jean-Marc Fedou, Guy Melanço...