Ada Wai-Chee Fu

According to our database1, Ada Wai-Chee Fu authored at least 166 papers between 1989 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
k-Pleased Querying.
IEEE Trans. Knowl. Data Eng., April, 2023

2022
Towards Secure and Efficient Equality Conjunction Search Over Outsourced Databases.
IEEE Trans. Cloud Comput., 2022

k-Pleased Querying (Extended Abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
Optimal location query based on k nearest neighbours.
Frontiers Comput. Sci., 2021

P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

2020
LSimRank: Node Similarity in a Labeled Graph.
Proceedings of the Web and Big Data - 4th International Joint Conference, 2020

2019
Repeatable Oblivious Shuffling of Large Outsourced Data Blocks.
IACR Cryptol. ePrint Arch., 2019

KOLQ in a Road Network.
Proceedings of the 20th IEEE International Conference on Mobile Data Management, 2019

Class Indistinguishability for Outsourcing Equality Conjunction Search.
Proceedings of the Cloud Computing - CLOUD 2019, 2019

Practical Access Pattern Privacy by Combining PIR and Oblivious Shuffle.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018
Query by Humming.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Counting Edges with Target Labels in Online Social Networks via Random Walk.
Proceedings of the 21st International Conference on Extending Database Technology, 2018

2017
READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank.
Proc. VLDB Endow., 2017

Counting Edges and Triangles in Online Social Networks via Random Walk.
Proceedings of the Web and Big Data - First International Joint Conference, 2017

2016
Distributed Maximal Clique Computation and Management.
IEEE Trans. Serv. Comput., 2016

Generalized bucketization scheme for flexible privacy settings.
Inf. Sci., 2016

Diversified Top-k Subgraph Querying in a Large Graph.
Proceedings of the 2016 International Conference on Management of Data, 2016

Finding multiple new optimal locations in a road network.
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

2015
Exact Top-k Nearest Keyword Search in Large Networks.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Minimum Spanning Trees in Temporal Graphs.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Reconstruction Privacy: Enabling Statistical Learning.
Proceedings of the 18th International Conference on Extending Database Technology, 2015

KeyLabel algorithms for keyword search in large graphs.
Proceedings of the 2015 IEEE International Conference on Big Data (IEEE BigData 2015), Santa Clara, CA, USA, October 29, 2015

Community Based Information Dissemination.
Proceedings of the Databases Theory and Applications, 2015

2014
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks.
Proc. VLDB Endow., 2014

Small sum privacy and large sum utility in data publishing.
J. Biomed. Informatics, 2014

Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks.
CoRR, 2014

(α, k)-Minimal Sorting and Skew Join in MPI and MapReduce.
CoRR, 2014

k-Balanced sorting and skew join in MPI and MapReduce.
Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

Distributed Maximal Clique Computation.
Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

Rectangle Counting in Large Bipartite Graphs.
Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

2013
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying.
Proc. VLDB Endow., 2013

Front Matter.
Proc. VLDB Endow., 2013

Collective spatial keyword queries: a distance owner-driven approach.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

TF-Label: a topological-folding labeling scheme for reachability querying in a large graph.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

Redundancy-aware maximal cliques.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying on Large Graphs
CoRR, 2012

Inferential or Differential: Privacy Laws Dictate
CoRR, 2012

Small Count Privacy and Large Count Utility in Data Publishing
CoRR, 2012

Randomization Resilient To Sensitive Reconstruction
CoRR, 2012

2011
Maximizing bichromatic reverse nearest neighbor for L p -norm in two- and three-dimensional spaces.
VLDB J., 2011

STAIRS: Towards efficient full-text filtering and dissemination in DHT environments.
VLDB J., 2011

Fast graph query processing with a low-cost index.
VLDB J., 2011

Finding maximal cliques in massive networks.
ACM Trans. Database Syst., 2011

Can the Utility of Anonymized Data be Used for Privacy Breaches?
ACM Trans. Knowl. Discov. Data, 2011

2010
Privacy-Preserving Data Publishing: An Overview
Synthesis Lectures on Data Management, Morgan & Claypool Publishers, ISBN: 978-3-031-01834-3, 2010

Optimal Resource Placement in Structured Peer-to-Peer Networks.
IEEE Trans. Parallel Distributed Syst., 2010

Query rewritings using views for XPath queries, framework, and methodologies.
Inf. Syst., 2010

Finding maximal cliques in massive networks by H*-graph.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

K-isomorphism: privacy preserving network publication against structural attacks.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Publishing Skewed Sensitive Microdata.
Proceedings of the SIAM International Conference on Data Mining, 2010

Probabilistic Inference Protection on Anonymized Data.
Proceedings of the ICDM 2010, 2010

Anonymizing Temporal Data.
Proceedings of the ICDM 2010, 2010

Global privacy guarantee in serial data publishing.
Proceedings of the 26th International Conference on Data Engineering, 2010

Computing Join Aggregates over Private Tables.
Proceedings of the Strategic Advancements in Utilizing Data Mining and Warehousing Technologies: New Concepts and Developments, 2010

2009
Query by Humming.
Proceedings of the Encyclopedia of Database Systems, 2009

Top-<i>k</i> typicality queries and efficient query answering methods on large databases.
VLDB J., 2009

Anonymization-based attacks in privacy-preserving data publishing.
ACM Trans. Database Syst., 2009

Online Skyline Analysis with Dynamic Preferences on Nominal Attributes.
IEEE Trans. Knowl. Data Eng., 2009

Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor.
Proc. VLDB Endow., 2009

(<i>alpha</i>, <i>k</i>)-anonymous data publishing.
J. Intell. Inf. Syst., 2009

Anonymization with Worst-Case Distribution-Based Background Knowledge
CoRR, 2009

Can the Utility of Anonymized Data be used for Privacy Breaches?
CoRR, 2009

Preserving Individual Privacy in Serial Data Publishing
CoRR, 2009

Efficient discovery of risk patterns in medical data.
Artif. Intell. Medicine, 2009

Efficient anomaly monitoring over moving object trajectory streams.
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

On Efficient Content Matching in Distributed Pub/Sub Systems.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

FF-Anonymity: When Quasi-identifiers Are Missing.
Proceedings of the 25th International Conference on Data Engineering, 2009

STAIRS: Towards Efficient Full-Text Filtering and Dissemination in a DHT Environment.
Proceedings of the 25th International Conference on Data Engineering, 2009

Workshop Organizers' Message.
Proceedings of the Database Systems for Advanced Applications, 2009

Online anonymity for personalized web services.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008
Privacy-Preserving Data Stream Classification.
Proceedings of the Privacy-Preserving Data Mining - Models and Algorithms, 2008

Scaling and time warping in time series querying.
VLDB J., 2008

Anonymization by Local Recoding in Data with Attribute Hierarchical Taxonomies.
IEEE Trans. Knowl. Data Eng., 2008

Efficient skyline querying with variable user preferences on nominal attributes.
Proc. VLDB Endow., 2008

Privacy preserving serial data publishing by role composition.
Proc. VLDB Endow., 2008

Computing Join Aggregates Over Private Tables.
Int. J. Data Warehous. Min., 2008

Clustering Text Data Streams.
J. Comput. Sci. Technol., 2008

Anonymizing transaction databases for publication.
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

Publishing Sensitive Transactions for Itemset Utility.
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

Multi-Prototype Concept and Object Typicality in Ontology.
Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, 2008

Anonymity for continuous data publishing.
Proceedings of the EDBT 2008, 2008

2007
Capabilities of outlier detection schemes in large datasets, framework and methodologies.
Knowl. Inf. Syst., 2007

(<i>alpha</i>, <i>k</i>)-anonymity Based Privacy Preservation by Lossy Join.
Proceedings of the Advances in Data and Web Management, 2007

On Efficient Spatial Matching.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Minimality Attack in Privacy Preserving Data Publishing.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Efficiently Answering Top-k Typicality Queries on Large Databases.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

WAT: Finding Top-K Discords in Time Series Database.
Proceedings of the Seventh SIAM International Conference on Data Mining, 2007

Mining favorable facets.
Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007

Computing Compressed Multidimensional Skyline Cubes Efficiently.
Proceedings of the 23rd International Conference on Data Engineering, 2007

Optimal proactive caching in peer-to-peer network: analysis and application.
Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

Ix-cubes: iceberg cubes for data warehousing and olap on xml data.
Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

Clustering Massive Text Data Streams by Semantic Smoothing Model.
Proceedings of the Advanced Data Mining and Applications, Third International Conference, 2007

2006
Finding Unusual Medical Time-Series Subsequences: Algorithms and Applications.
IEEE Trans. Inf. Technol. Biomed., 2006

Utility-based anonymization for privacy preservation with less information loss.
SIGKDD Explor., 2006

Mining top-<i>K</i> frequent itemsets from data streams.
Data Min. Knowl. Discov., 2006

Utility-based anonymization using local recoding.
Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006

(alpha, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing.
Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006

Achieving <i>k</i>-Anonymity by Clustering in Attribute Hierarchical Structures.
Proceedings of the Data Warehousing and Knowledge Discovery, 8th International Conference, 2006

Classification spanning correlated data streams.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

Finding Time Series Discords Based on Haar Transform.
Proceedings of the Advanced Data Mining and Applications, Second International Conference, 2006

2005
Projective Clustering by Histograms.
IEEE Trans. Knowl. Data Eng., 2005

Integration and Efficient Lookup of Compressed XML Accessibility Maps.
IEEE Trans. Knowl. Data Eng., 2005

Optimal all-to-all personalised exchange in a novel optical multistage interconnection network.
Int. J. High Perform. Comput. Netw., 2005

Mining N-most interesting itemsets without support threshold by the COFI-tree.
Int. J. Bus. Intell. Data Min., 2005

Data Mining for Inventory Item Selection with Cross-Selling Considerations.
Data Min. Knowl. Discov., 2005

Scaling and Time Warping in Time Series Querying.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Mining Top-K Itemsets over a Sliding Window Based on Zipfian Distribution.
Proceedings of the 2005 SIAM International Conference on Data Mining, 2005

Mining risk patterns in medical data.
Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

Dot Plots for Time Series Analysis.
Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 2005

HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence.
Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

Mining Patterns That Respond to Actions.
Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

Privacy-Preserving Frequent Pattern Mining across Private Databases.
Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

Routing and Scheduling for a Novel Optical Multistage Interconnection Network.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

Approximations to Magic: Finding Unusual Medical Time Series.
Proceedings of the 18th IEEE Symposium on Computer-Based Medical Systems (CBMS 2005), 2005

2004
Mining Frequent Itemsets without Support Threshold: With and without Item Constraints.
IEEE Trans. Knowl. Data Eng., 2004

Supporting Dispute Handling in E-Commerce Transactions, a Framework and Related Methodologies.
Electron. Commer. Res., 2004

ISM: Item Selection for Marketing with Cross-Selling Considerations.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2004

2003
Optimal Algorithms for Finding User Access Sessions from Very Large Web Logs.
World Wide Web, 2003

Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping.
IEEE Trans. Knowl. Data Eng., 2003

Mining Changes of Classification by Correspondence Tracing.
Proceedings of the Third SIAM International Conference on Data Mining, 2003

Mining Frequent Episodes for Relating Financial Events and Stock Trends.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2003

Linear Time Algorithms for Finding Maximal Forward References.
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

Enhancements on Local Outlier Detection.
Proceedings of the 7th International Database Engineering and Applications Symposium (IDEAS 2003), 2003

Modeling and Efficient Mining of Intentional Knowledge of Outliers.
Proceedings of the 7th International Database Engineering and Applications Symposium (IDEAS 2003), 2003

Linear and Sublinear Time Algorithms for Mining Frequent Traversal Path Patterns from Very Large Web Logs.
Proceedings of the 7th International Database Engineering and Applications Symposium (IDEAS 2003), 2003

MPIS: Maximal-Profit Item Selection with Cross-Selling Considerations.
Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

Load Balancing between Heterogeneous Computing Clusters.
Proceedings of the Grid and Cooperative Computing, Second International Workshop, 2003

On Complementarity of Cluster and Outlier Detection Schemes.
Proceedings of the Data Warehousing and Knowledge Discovery, 5th International Conference, 2003

Fast Construction of Generalized Suffix Trees Over a Very Large Alphabet.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Efficient Accessibility Lookup for XML.
Proceedings of the 21st IASTED International Multi-Conference on Applied Informatics (AI 2003), 2003

2002
A Gracefully Degradable Declustered RAID Architecture.
Clust. Comput., 2002

Enhancing Effectiveness of Outlier Detections for Low Density Patterns.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2002

Mining Association Rules from Stars.
Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 2002

Efficient Algorithm for Projected Clustering.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

FP-tree approach for mining N -most interesting itemsets.
Proceedings of the Data Mining and Knowledge Discovery: Theory, 2002

2001
Hierarchical Classification of Documents with Error Control.
Proceedings of the Knowledge Discovery and Data Mining, 2001

From XML to Relational Databases.
Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB 2001), 2001

Secure E-Commerce Transactions, Modeling and Implementation Aspects.
Proceedings of the Semantic Issues in E-Commerce Systems, 2001

Algorithm for Discovering Multivalued Dependencies.
Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, 2001

2000
Dynamic vp-Tree Indexing for n-Nearest Neighbor Search Given Pair-Wise Distances.
VLDB J., 2000

Efficient Rule-Based Attribute-Oriented Induction for Data Mining.
J. Intell. Inf. Syst., 2000

Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System.
Distributed Parallel Databases, 2000

A reconfigurable fault-tolerant hypercube architecture with global sparing.
Proceedings of the 2000 Pacific Rim International Symposium on Dependable Computing (PRDC 2000), 2000

An Improved Direct Dimension Exchange Method for Load Balancing in k-ary n-cube Multicomputers.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

Mining <i>N</i>-most Interesting Itemsets.
Proceedings of the Foundations of Intelligent Systems, 12th International Symposium, 2000

Clustering Categorical Data.
Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28, 2000

Finding Structure and Characteristics of Web Documents for Classification.
Proceedings of the 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000

Discovering Temporal Patterns for Interval-Based Events.
Proceedings of the Data Warehousing and Knowledge Discovery, 2000

A Gracefully Degradable Declustered RAID Architecture with near Optimal Maximal Read and Write Parallelism.
Proceedings of the 2000 IEEE International Conference on Cluster Computing (CLUSTER 2000), November 28th, 2000

1999
Estimate of exponential convergence rate and exponential stability for neural networks.
IEEE Trans. Neural Networks, 1999

Locating Corruptions in a Replicated File in a Distributed Environment.
J. Supercomput., 1999

Entropy-based Subspace Clustering for Mining Numerical Data.
Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999

Efficient Time Series Matching by Wavelets.
Proceedings of the 15th International Conference on Data Engineering, 1999

1998
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees.
IEEE Trans. Parallel Distributed Syst., 1998

Mining Fuzzy Association Rules in Databases.
SIGMOD Rec., 1998

Enhanced Nearest Neighbour Search on the R-tree.
SIGMOD Rec., 1998

Mining Association Rules with Weighted Items.
Proceedings of the 1998 International Database Engineering and Applications Symposium, 1998

Triple-Node Hierarchies for Object-Oriented Database Indexing.
Proceedings of the 1998 ACM CIKM International Conference on Information and Knowledge Management, 1998

1997
Delay-Optimal Quorum Consensus for Distributed Systems.
IEEE Trans. Parallel Distributed Syst., 1997

1996
Efficient Mining of Association Rules in Distributed Databases.
IEEE Trans. Knowl. Data Eng., 1996

Locating More Corruptions in a Replicated File.
Proceedings of the 15th Symposium on Reliable Distributed Systems, 1996

A Fast Distributed Algorithm for Mining Association Rules.
Proceedings of the Fourth International Conference on Parallel and Distributed Information Systems, 1996

1995
Efficient Algorithms for Attribute-Oriented Induction.
Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD-95), 1995

1994
A Transaction Replication Scheme for a Replicated Database with Node Autonomy.
Proceedings of the VLDB'94, 1994

A Case-Based Reasoning Approach for Associative Query Answering.
Proceedings of the Methodologies for Intelligent Systems, 8th International Symposium, 1994

1989
Concurrency Control of Nested Transactions Accessing B-Trees.
Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989


  Loading...