Ðа пÑÐ°Ð²Ð°Ñ ÑÑкопиÑи
Ðа пÑÐ°Ð²Ð°Ñ ÑÑкопиÑи
Ðа пÑÐ°Ð²Ð°Ñ ÑÑкопиÑи
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
288. Saigo H.; Kadowaki T.; Tsuda K. In A Linear Programming Approach for Molecular<br />
QSAR analysis, International Workshop on Mining and Learning with Graphs<br />
2006. - 2006. - P. 85-96.<br />
289. Asai T.; Abe K.; Kawasoe S.; Arimura H.; Satamoto H.; Arikawa S. Efficient<br />
Substructure Discovery from Large Semi-structured Data. // SIAM SDM'02. - 2002.<br />
290. Chi Y.; Muntz R.R.; Nijssen S.; Kok J.N. Frequent subtree mining -- an overview.<br />
// Fundamenta Informaticae - 2005. - V. 66, № 1-2. - P. 161-198.<br />
291. Inokuchi A.; Washio T.; Motoda H. In An Apriori-Based Algorithm for Mining<br />
Frequent Substructures from Graph Data, 4th European Conf. on Principles and Practice<br />
of Knowledge Discovery in Databases (PKDD), Lyon, France, September 2000,<br />
2000; Lyon, France, September 2000. - 2000. - P. 13-23.<br />
292. Kuramochi M.; Karypis G. In Frequent Subgraph Discovery, 1st IEEE Conference<br />
on Data Mining, 2001. - 2001. - P. 313-320.<br />
293. Borgelt C.; Meinl T.; Berthold M. MoSS: A Program for Molecular Substructure<br />
Mining. // Proceedings of the 1st international Workshop on Open Source Data<br />
Mining: Frequent Pattern Mining Implementations ACM Press, New York, NY: Chicago,<br />
Illinois, August 21 - 21, 2005. - 2005. - P. 6-15.<br />
294. Zaki M.J. Efficiently mining frequent trees in a forest. // Proceedings of the<br />
eighth ACM SIGKDD international conference on Knowledge discovery and data<br />
mining, ACM Press: Edmonton, Alberta, Canada. - 2002. - P. 71-80<br />
295. Chi Y.; Yang Y.; Muntz R.R. HybridTreeMiner: An efficient algorithm for mining<br />
frequent rooted trees and free trees using canonical forms. // The 16th International<br />
Conference on Scientific and Statistical Database Management (SSDBM'04),<br />
June 2004. - 2004.<br />
296. Chi Y.; Yang Y.; Xia Y.; Muntz R.R. CMTreeMiner: Mining both closed and<br />
maximal frequent subtrees. // The Eighth Pacific Asia Conference on Knowledge<br />
Discovery and Data Mining (PAKDD'04), May 2004. - 2004.<br />
297. Dehaspe L.; Toivonen H.; King R.D. Finding frequent substructures in chemical<br />
compounds. // 4th International Conference on Knowledge Discovery and Data<br />
Mining, Agrawal R.; Stolorz P.; Piatetsky-Shapiro G., Eds. AAAI Press. - 1998. - P.<br />
30-36.<br />
341
Change language