Ada Wai-chee Fu
#165,285
Most Influential Person Now
Ada Wai-chee Fu's AcademicInfluence.com Rankings
Ada Wai-chee Fucomputer-science Degrees
Computer Science
#9856
World Rank
#10339
Historical Rank
Data Mining
#238
World Rank
#239
Historical Rank
Database
#6806
World Rank
#7045
Historical Rank
Download Badge
Computer Science
Ada Wai-chee Fu's Degrees
- PhD Computer Science University of California, Berkeley
- Masters Computer Science University of California, Berkeley
- Bachelors Computer Science University of California, Berkeley
Similar Degrees You Can Earn
Why Is Ada Wai-chee Fu Influential?
(Suggest an Edit or Addition)Ada Wai-chee Fu's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Efficient time series matching by wavelets (1999) (1208)
- HOT SAX: efficiently finding the most unusual time series subsequence (2005) (761)
- (α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing (2006) (712)
- Entropy-based subspace clustering for mining numerical data (1999) (610)
- Mining fuzzy association rules in databases (1998) (560)
- A fast distributed algorithm for mining association rules (1996) (546)
- Enhancing Effectiveness of Outlier Detections for Low Density Patterns (2002) (496)
- Mining association rules with weighted items (1998) (494)
- Utility-based anonymization using local recoding (2006) (444)
- Efficient Mining of Association Rules in Distributed Databases (1996) (418)
- K-isomorphism: privacy preserving network publication against structural attacks (2010) (367)
- Minimality Attack in Privacy Preserving Data Publishing (2007) (329)
- Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping (2003) (253)
- Scaling and time warping in time series querying (2005) (229)
- Anonymizing transaction databases for publication (2008) (220)
- Discovering Temporal Patterns for Interval-Based Events (2000) (215)
- Enhanced nearest neighbour search on the R-tree (1998) (183)
- Efficient anomaly monitoring over moving object trajectory streams (2009) (164)
- Mining frequent itemsets without support threshold: with and without item constraints (2004) (150)
- Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances (2000) (143)
- Introduction to Privacy-Preserving Data Publishing: Concepts and Techniques (2010) (143)
- Approximations to magic: finding unusual medical time series (2005) (135)
- Incremental Document Clustering for Web Page Classification (2002) (133)
- Anonymity for continuous data publishing (2008) (131)
- Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor (2009) (130)
- Finding maximal cliques in massive networks (2011) (124)
- Collective spatial keyword queries: a distance owner-driven approach (2013) (122)
- Enhancements on local outlier detection (2003) (104)
- Finding maximal cliques in massive networks by H*-graph (2010) (100)
- Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures (2006) (100)
- Estimate of exponential convergence rate and exponential stability for neural networks (1999) (95)
- TF-Label: a topological-folding labeling scheme for reachability querying in a large graph (2013) (94)
- Mining risk patterns in medical data (2005) (94)
- WAT: Finding Top-K Discords in Time Series Database (2007) (91)
- Privacy preserving serial data publishing by role composition (2008) (90)
- Mining N-most Interesting Itemsets (2000) (89)
- Can the Utility of Anonymized Data be Used for Privacy Breaches? (2009) (87)
- Utility-based anonymization for privacy preservation with less information loss (2006) (86)
- Mining top-K frequent itemsets from data streams (2006) (81)
- Capabilities of outlier detection schemes in large datasets, framework and methodologies (2006) (80)
- Finding Unusual Medical Time-Series Subsequences: Algorithms and Applications (2006) (79)
- Clustering Categorical Data (2000) (79)
- On Efficient Spatial Matching (2007) (79)
- Data Mining for Inventory Item Selection with Cross-Selling Considerations (2005) (79)
- Computing Compressed Multidimensional Skyline Cubes Efficiently (2007) (78)
- IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying (2012) (76)
- Efficient skyline querying with variable user preferences on nominal attributes (2007) (71)
- Finding Time Series Discords Based on Haar Transform (2006) (70)
- Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks (2014) (70)
- Finding Fuzzy Sets for the Mining of Fuzzy Association Rules for Numerical Attributes (1998) (70)
- Projective clustering by histograms (2005) (66)
- Clustering Text Data Streams (2008) (64)
- HOT SAX: Finding the Most Unusual Time Series Subsequence: Algorithms and Applications (2004) (63)
- Publishing Sensitive Transactions for Itemset Utility (2008) (62)
- Anonymization by Local Recoding in Data with Attribute Hierarchical Taxonomies (2008) (62)
- Mining Frequent Episodes for Relating Financial Events and Stock Trends (2003) (59)
- Efficient discovery of risk patterns in medical data (2009) (58)
- Online anonymity for personalized web services (2009) (57)
- Mining association rules from stars (2002) (56)
- Minimum Spanning Trees in Temporal Graphs (2015) (55)
- Exact Top-k Nearest Keyword Search in Large Networks (2015) (54)
- Mining Changes of Classification by Correspondence Tracing (2003) (54)
- Optimal Resource Placement in Structured Peer-to-Peer Networks (2010) (53)
- Redundancy-aware maximal cliques (2013) (50)
- MPIS: maximal-profit item selection with cross-selling considerations (2003) (49)
- Optimal Algorithms for Finding User Access Sessions from Very Large Web Logs (2002) (48)
- Delay-Optimal Quorum Consensus for Distributed Systems (1997) (46)
- (α, k)-anonymous data publishing (2009) (45)
- Efficient Rule-Based Attribute-Oriented Induction for Data Mining (2000) (43)
- Privacy-Preserving Data Publishing: An Overview (2010) (41)
- Fast graph query processing with a low-cost index (2011) (40)
- Diversified Top-k Subgraph Querying in a Large Graph (2016) (40)
- Finding Structure and Characteristics of Web Documents for Classification (2000) (38)
- Efficiently Answering Top-k Typicality Queries on Large Databases (2007) (38)
- READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank (2017) (38)
- Optimal proactive caching in peer-to-peer network: analysis and application (2007) (37)
- Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional spaces (2011) (36)
- Knowledge discovery in databases: A rule-based attribute-oriented approach (1994) (34)
- Global privacy guarantee in serial data publishing (2010) (34)
- Online Skyline Analysis with Dynamic Preferences on Nominal Attributes (2009) (32)
- Rectangle Counting in Large Bipartite Graphs (2014) (31)
- Mining favorable facets (2007) (31)
- Privacy-preserving frequent pattern mining across private databases (2005) (31)
- Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees (1998) (30)
- FF-Anonymity: When Quasi-identifiers Are Missing (2009) (30)
- Dot plots for time series analysis (2005) (29)
- Distributed Maximal Clique Computation and Management (2016) (29)
- A Transaction Replication Scheme for a Replicated Database with Node Autonomy (1994) (28)
- On Efficient Content Matching in Distributed Pub/Sub Systems (2009) (28)
- Mining N-most interesting itemsets without support threshold by the COFI-tree (2005) (27)
- Distributed Maximal Clique Computation (2014) (27)
- Anonymization-based attacks in privacy-preserving data publishing (2009) (26)
- Efficient Algorithms for Attribute-Oriented Induction (1995) (24)
- Mining patterns that respond to actions (2005) (23)
- Ix-cubes: iceberg cubes for data warehousing and olap on xml data (2007) (22)
- Hierarchical Classification of Documents with Error Control (2001) (22)
- On Complementarity of Cluster and Outlier Detection Schemes (2003) (22)
- Top-k typicality queries and efficient query answering methods on large databases (2009) (22)
- Mining Top-K Itemsets over a Sliding Window Based on Zipfian Distribution (2005) (21)
- Integration and efficient lookup of compressed XML accessibility maps (2005) (20)
- Query by Humming (2009) (20)
- Proceedings of the 2017 ACM on Conference on Information and Knowledge Management (2017) (20)
- Load balancing between computing clusters (2003) (19)
- Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System (2000) (18)
- Linear time algorithms for finding maximal forward references (2003) (17)
- Generalized bucketization scheme for flexible privacy settings (2016) (17)
- Routing and Scheduling for a Novel Optical Multistage Interconnection Network (2005) (16)
- Anonymizing Temporal Data (2010) (16)
- Privacy-Preserving Data Stream Classification (2008) (16)
- STAIRS: Towards efficient full-text filtering and dissemination in DHT environments (2009) (16)
- Multi-Prototype Concept and Object Typicality in Ontology (2008) (14)
- Finding the Unusual Medical Time Series: Algorithms and Applications (2005) (14)
- A Case-Based Reasoning Approach for Associative Query Answering (1994) (12)
- (alpha, k)-anonymity Based Privacy Preservation by Lossy Join (2007) (12)
- A Gracefully Degradable Declustered RAID Architecture (2004) (12)
- FP-tree approach for mining N-most interesting itemsets (2002) (11)
- ISM: Item Selection for Marketing with Cross-Selling Considerations (2004) (11)
- Finding multiple new optimal locations in a road network (2016) (11)
- Clustering Massive Text Data Streams by Semantic Smoothing Model (2007) (9)
- Modeling and efficient mining of intentional knowledge of outliers (2003) (9)
- An optical multistage interconnection network for optimal all-to-all personalized exchange (2003) (9)
- Small sum privacy and large sum utility in data publishing (2014) (9)
- Linear and sublinear time algorithms for mining frequent traversal path patterns from very large Web logs (2003) (8)
- Adaptive color histogram indexing (1995) (8)
- Efficient algorithm for projected clustering (2002) (8)
- Fast Construction of Generalized Suffix Trees Over a Very Large Alphabet (2003) (8)
- Load Balancing between Heterogeneous Computing Clusters (2003) (7)
- Small Count Privacy and Large Count Utility in Data Publishing (2012) (7)
- Privacy-Preserving Classification for Data Streams (2007) (7)
- From XML to Relational Databases (2001) (7)
- Supporting Dispute Handling in E-Commerce Transactions, a Framework and Related Methodologies (2004) (7)
- Reconstruction Privacy: Enabling Statistical Learning (2015) (7)
- Practical Access Pattern Privacy by Combining PIR and Oblivious Shuffle (2019) (7)
- Classification spanning correlated data streams (2006) (6)
- Repeatable Oblivious Shuffling of Large Outsourced Data Blocks (2019) (6)
- Locating more corruptions in a replicated file (1996) (5)
- Computing Join Aggregates Over Private Tables (2007) (5)
- Hypercube quorum consensus for mutual exclusion and replicated data management (1998) (5)
- Association Rule Mining and Its Applications to MPIS (2005) (5)
- P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators (2021) (5)
- KeyLabel algorithms for keyword search in large graphs (2015) (5)
- Probabilistic Inference Protection on Anonymized Data (2010) (5)
- Query rewritings using views for XPath queries, framework, and methodologies (2010) (5)
- Algorithm for discovering multivalued dependencies (2001) (5)
- Efficient Web Mining for Traversal Path Patterns (2005) (4)
- Anonymization for Global Privacy Guarantee in Serial Data Publishing (2010) (4)
- KOLQ in a Road Network (2019) (3)
- A gracefully degradable declustered RAID architecture with near optimal maximal read and write parallelism (2000) (3)
- Counting Edges and Triangles in Online Social Networks via Random Walk (2017) (3)
- Randomization Resilient To Sensitive Reconstruction (2012) (3)
- Entropy-based Subspace Clustering for Mining Numerical (2009) (3)
- Multidimensional k-Anonymization by Linear Clustering Using Space-Filling Curves (2006) (3)
- Triple-node hierarchies for object-oriented database indexing (1998) (3)
- Publishing Skewed Sensitive Microdata (2010) (3)
- Inferential or Differential: Privacy Laws Dictate (2012) (2)
- k-Balanced sorting and skew join in MPI and MapReduce (2014) (2)
- (α, k)-Minimal Sorting and Skew Join in MPI and MapReduce (2014) (2)
- Towards Secure and Efficient Equality Conjunction Search Over Outsourced Databases (2020) (2)
- Preserving Individual Privacy in Serial Data Publishing (2009) (1)
- Optimal all-to-all personalised exchange in a novel optical multistage interconnection network (2005) (1)
- Counting Edges with Target Labels in Online Social Networks via Random Walk (2018) (1)
- Locating Corruptions in a Replicated File in a Distributed Environment (2004) (1)
- Running Head : COMPUTING JOIN AGGREGATES Computing Join Aggregates over Private Tables (2007) (1)
- Class Indistinguishability for Outsourcing Equality Conjunction Search (2019) (1)
- Efficient Accessibility Lookup for XML (2003) (1)
- Secure E-Commerce Transactions, Modeling and Implementation Aspects (2001) (0)
- Anonymization for Cluster Analysis (2010) (0)
- k-Pleased Querying (Extended Abstract) (2022) (0)
- Anonymization for Data Mining (2010) (0)
- Multiple Views Publishing (2010) (0)
- Algorithms for Detecting Distance-Based Outliers in High Dimensions (2007) (0)
- An Improved Direct Dimension Exchange Method for Load Balancing in k-ary n-cube Multicomputers (2000) (0)
- Optimal Algorithms for Finding User A essSessions from Very Large Web (2007) (0)
- Chapter 20 Privacy-Preserving Data Stream Classification (2008) (0)
- Community Based Information Dissemination (2015) (0)
- Collaborative Anonymization for Horizontally Partitioned Data (2010) (0)
- Anonymization with Worst-Case Distribution-Based Background Knowledge (2009) (0)
- Choosing Best Items by Considering Relationships Between Items (2004) (0)
- A reconfigurable fault-tolerant hypercube architecture with global sparing (2000) (0)
- Sanitizing Textual Data (2010) (0)
- Extended Data Publishing Scenarios (2010) (0)
- Anonymizing Transaction Data (2010) (0)
- Workshop Organizers' Message (2009) (0)
- Anonymization for Classification Analysis: A Case Study on the Red Cross (2010) (0)
- Anonymizing Trajectory Data (2010) (0)
- Attack Models and Privacy Models (2010) (0)
- Optimal location query based on k nearest neighbours (2021) (0)
- Anonymizing Complex Data (2010) (0)
- Collaborative Anonymization for Vertically Partitioned Data (2010) (0)
- Anonymizing Sequential Releases with New Attributes (2010) (0)
- Other Privacy-Preserving Techniques and Future Trends (2010) (0)
- Optimal location query based on k nearest neighbours (2021) (0)
- LSimRank: Node Similarity in a Labeled Graph (2020) (0)
- Anonymizing Incrementally Updated Data Records (2010) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Ada Wai-chee Fu?
Ada Wai-chee Fu is affiliated with the following schools:
