196 search results - page 4 / 40 » Data discretization: taxonomy and big data challenge |
281
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
158
click to vote
HICSS
2009
IEEE
16 years 1 months ago
2009
IEEE
Big data presents new challenges to both cluster infrastructure software and parallel application design. We present a set of software services and design principles for data inte...
161
click to vote
DIS
2008
Springer
15 years 8 months ago
2008
Springer
Taxonomies for a set of features occur in many real-world domains. An example is provided by paleontology, where the task is to determine the age of a fossil site on the basis of t...
212
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...
171
click to vote
FCSC
2008
15 years 6 months ago
2008
With the development of World Wide Web (WWW), storage and utilization of web data has become a big challenge for data management research community. Web data are essentially hetero...