Sciweavers

982 search results - page 110 / 197
» Hierarchical comments-based clustering
Sort
View
KBSE
2008
IEEE
14 years 3 months ago
Discovering Patterns of Change Types
The reasons why software is changed are manyfold; new features are added, bugs have to be fixed, or the consistency of coding rules has to be re-established. Since there are many...
Beat Fluri, Emanuel Giger, Harald Gall
MDAI
2007
Springer
14 years 3 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...
WWW
2005
ACM
14 years 2 months ago
X-warehouse: building query pattern-driven data
In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of in...
Ji Zhang, Wei Wang, Han Liu, Sheng Zhang
JMLR
2011
167views more  JMLR 2011»
13 years 4 months ago
Logistic Stick-Breaking Process
A logistic stick-breaking process (LSBP) is proposed for non-parametric clustering of general spatially- or temporally-dependent data, imposing the belief that proximate data are ...
Lu Ren, Lan Du, Lawrence Carin, David B. Dunson
ICASSP
2011
IEEE
13 years 25 days ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus