Sciweavers

4560 search results - page 68 / 912
» Finding Data in the Neighborhood
Sort
View
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 2 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
PKDD
2007
Springer
76views Data Mining» more  PKDD 2007»
14 years 2 months ago
Finding Transport Proteins in a General Protein Database
The number of specialized databases in molecular biology is growing fast, as is the availability of molecular data. These trends necessitate the development of automatic methods fo...
Sanmay Das, Milton H. Saier Jr., Charles Elkan
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree
SOFTCO
2004
Springer
14 years 1 months ago
MultiNNProm: A Multi-Classifier System for Finding Genes
The computational identification of genes in DNA sequences has become an issue of crucial importance due to the large number of DNA molecules being currently sequenced. We present ...
Romesh Ranawana, Vasile Palade
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
14 years 25 days ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis