1897 search results - page 227 / 380 » Mining Chains of Relations |
180
click to vote
DMKD
1997
ACM
15 years 10 months ago
1997
ACM
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
179
click to vote
QEST
2005
IEEE
16 years 2 days ago
2005
IEEE
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
280
click to vote
ICDE
2001
IEEE
16 years 7 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
160
click to vote
DIS
2007
Springer
16 years 20 days ago
2007
Springer
We present an interactive discovery support system, which for a given starting concept of interest, discovers new, potentially meaningful relations with other concepts that have no...
185
click to vote
PKDD
2007
Springer
16 years 18 days ago
2007
Springer
A relevance filter is proposed which removes features based on the mutual information between class labels and features. It is proven that both feature independence and class condi...