Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Tsay Young Lin"'
Publikováno v:
ICDM Workshops
The collection of the concepts that are discussed in a document set can be represented by a geometric structure, called simplical complex, of combinatorial topology. A simplex is a high-frequency keyword set that co-occurs closely which, we believe,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9944a7fcfd65654b17a118d4f4671b2
https://doi.org/10.1109/icdmw.2006.48
https://doi.org/10.1109/icdmw.2006.48
Autor:
Tsay Young Lin
Publikováno v:
ICDM
The main theorem is: generalized associations of a relational table can be found by a finite set of linear inequalities within polynomial time. It is derived from the following three results, which were established in ICDMO'02 and are re-developed he
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55c6be683801b3168cc9465563007c8c
https://doi.org/10.1109/icdm.2004.10098
https://doi.org/10.1109/icdm.2004.10098
Autor:
Tsay Young Lin
Publikováno v:
ICDM
A "correct" selection of attributes (features) is vital in data mining. As a first step, this paper constructs all possible attributes of a given relation. The results are based on the observations that each relation is isomorphic to a unique abstrac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f925cbbb05378c03b75b94f9d69ae78
https://doi.org/10.1109/icdm.2002.1183914
https://doi.org/10.1109/icdm.2002.1183914
Autor:
Tsay Young Lin
Publikováno v:
Fourth IEEE International Conference on Data Mining (ICDM'04); 2004, p154-161, 8p
Autor:
Tsay Young Lin
Publikováno v:
2002 IEEE International Conference on Data Mining, 2002. Proceedings; 2002, p282-289, 8p