Sciweavers

12863 search results - page 832 / 2573
» Dynamic Data Mining
Sort
View
ICCS
2007
Springer
16 years 1 months ago
Learning Common Outcomes of Communicative Actions Represented by Labeled Graphs
We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in te...
Boris Galitsky, Boris Kovalerchuk, Sergei O. Kuzne...
ECLIPSE
2006
ACM
16 years 1 months ago
FrUiT: IDE support for framework understanding
Frameworks provide means to reuse existing design and functionality, but first require developers to understand how to use them. Learning the correct usage of a framework can be ...
Marcel Bruch, Thorsten Schäfer, Mira Mezini
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
16 years 1 months ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
GFKL
2007
Springer
158views Data Mining» more  GFKL 2007»
15 years 11 months ago
Investigating Classifier Learning Behavior with Experiment Databases
Experimental assessment of the performance of classification algorithms is an important aspect of their development and application on real-world problems. To facilitate this analy...
Joaquin Vanschoren, Hendrik Blockeel
SDM
2007
SIAM
74views Data Mining» more  SDM 2007»
15 years 9 months ago
HACS: Heuristic Algorithm for Clustering Subsets
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
Ding Yuan, W. Nick Street