The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Vertical Database Design for Scalable Data Mining
|
Author(s): William Perrizo (North Dakota State University, USA), Qiang Ding (Concordia College, USA), Masum Serazi (North Dakota State University, USA), Taufik Abidin (North Dakota State University, USA)and Baoying Wang (North Dakota State University, USA)
Copyright: 2005
Pages: 4
Source title:
Encyclopedia of Database Technologies and Applications
Source Author(s)/Editor(s): Laura C. Rivero (UNICEN, Argentina), Jorge Horacio Doorn (UNICEN, Argentina)and Viviana E. Ferraggine (UNICEN, Argentina)
DOI: 10.4018/978-1-59140-560-3.ch120
Purchase
|
Abstract
For several decades and especially with the preeminence of relational database systems, data is almost always formed into horizontal record structures and then processed vertically (vertical scans of files of horizontal records). This makes good sense when the requested result is a set of horizontal records. In knowledge discovery and data mining, however, researchers are typically interested in collective properties or predictions that can be expressed very briefly. Therefore, the approaches for scan-based processing of horizontal records are known to be inadequate for data mining in very large data repositories (Han & Kamber, 2001; Han, Pei, & Yin, 2000; Shafer, Agrawal, & Mehta, 1996).
Related Content
Renjith V. Ravi, Mangesh M. Ghonge, P. Febina Beevi, Rafael Kunst.
© 2022.
24 pages.
|
Manimaran A., Chandramohan Dhasarathan, Arulkumar N., Naveen Kumar N..
© 2022.
20 pages.
|
Ram Singh, Rohit Bansal, Sachin Chauhan.
© 2022.
19 pages.
|
Subhodeep Mukherjee, Manish Mohan Baral, Venkataiah Chittipaka.
© 2022.
17 pages.
|
Vladimir Nikolaevich Kustov, Ekaterina Sergeevna Selanteva.
© 2022.
23 pages.
|
Krati Reja, Gaurav Choudhary, Shishir Kumar Shandilya, Durgesh M. Sharma, Ashish K. Sharma.
© 2022.
18 pages.
|
Nwosu Anthony Ugochukwu, S. B. Goyal.
© 2022.
23 pages.
|
|
|