Sciweavers

398 search results - page 56 / 80
» A new biclustering technique based on crossing minimization
Sort
View
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 23 days ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
187
Voted
ICDE
2005
IEEE
173views Database» more  ICDE 2005»
16 years 1 months ago
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
Xuemin Lin, Yidong Yuan, Wei Wang 0011, Hongjun Lu
IH
1999
Springer
15 years 4 months ago
Hiding Signatures in Graph Coloring Solutions
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
Gang Qu, Miodrag Potkonjak
115
Voted
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 24 days ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
103
Voted
CARS
2001
15 years 1 months ago
Computer-based periaxial rotation measurement for aligning fractured femur fragments
A new computer-based method for measuring periaxial rotation of healthy and fractured femurs from preoperative CT during closed femoral fracture reduction surgery is described. Th...
Ofer Ron, Leo Joskowicz, Ariel Simkin, Charles Mil...