Sciweavers

456 search results - page 65 / 92
» Discovering Associations in XML Data
Sort
View
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 3 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
SSD
2005
Springer
185views Database» more  SSD 2005»
14 years 3 months ago
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
Quinn Hart, Michael Gertz, Jie Zhang
CLIMA
2004
13 years 11 months ago
The Apriori Stochastic Dependency Detection (ASDD) Algorithm for Learning Stochastic Logic Rules
Apriori Stochastic Dependency Detection (ASDD) is an algorithm for fast induction of stochastic logic rules from a database of observations made by an agent situated in an environm...
Christopher Child, Kostas Stathis
WISE
2005
Springer
14 years 3 months ago
A Web Recommendation Technique Based on Probabilistic Latent Semantic Analysis
Web transaction data between Web visitors and Web functionalities usually convey user task-oriented behavior pattern. Mining such type of clickstream data will lead to capture usag...
Guandong Xu, Yanchun Zhang, Xiaofang Zhou
RCIS
2010
13 years 8 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu