Sciweavers

196 search results - page 4 / 40
» Data discretization: taxonomy and big data challenge
Sort
View
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
16 years 20 days ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
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...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
83
Voted
HICSS
2009
IEEE
122views Biometrics» more  HICSS 2009»
15 years 6 months ago
GrayWulf: Scalable Software Architecture for Data Intensive Computing
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...
Yogesh Simmhan, Roger S. Barga, Catharine van Inge...
DIS
2008
Springer
15 years 1 months ago
Feature Selection in Taxonomies with Applications to Paleontology
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...
Gemma C. Garriga, Antti Ukkonen, Heikki Mannila
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
13 years 1 months ago
Discovering Multiple Clustering Solutions: Grouping Objects in Different Views of the Data
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...
Emmanuel Müller, Stephan Günnemann, Ines...
FCSC
2008
123views more  FCSC 2008»
14 years 11 months ago
Using Wide Table to manage web data: a survey
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...
Bin Yang 0002, Weining Qian, Aoying Zhou